262 (number)
(Redirected from Draft:262 (Number))
| ||||
|---|---|---|---|---|
| Cardinal | two hundred sixty-two | |||
| Ordinal | 262nd (two hundred sixty-second) | |||
| Factorization | 2 × 131 | |||
| Divisors | 1, 2, 131, 262 | |||
| Greek numeral | ΣΞΒ´ | |||
| Roman numeral | CCLXII | |||
| Binary | 1000001102 | |||
| Ternary | 1002013 | |||
| Senary | 11146 | |||
| Octal | 4068 | |||
| Duodecimal | 19A12 | |||
| Hexadecimal | 10616 | |||
262 (two hundred [and] sixty-two) is a natural number preceded by the number 261 and followed by 263. It has the prime factorization 2·131.
Mathematical properties
[edit]There are four divisors of this number, the divisors being 1, 2, 131, and 262 itself, which makes it a semiprime.
It is the sixth meandric number,[1] and the ninth open meandric number.[2]
As it cannot be divided into the sum of the proper divisors of any number, it is the 17th untouchable number.[3]
As it eventually reaches 1 when replaced by the sum of the square of each digit, it is the 40th 10-happy number.[4]
As 262 is 262 backwards, it is a palindromic number.[5]
References
[edit]- ^ Sloane, N. J. A. (ed.). "Sequence A005315 (Closed meandric numbers (or meanders): number of ways a loop can cross a road 2n times)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ^ Sloane, N. J. A. (ed.). "Sequence A005316 (Meandric numbers: number of ways a river can cross a road n times)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ^ Sloane, N. J. A. (ed.). "Sequence A005114 (Untouchable numbers, also called nonaliquot numbers: impossible values for the sum of aliquot parts function)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ^ Sloane, N. J. A. (ed.). "Sequence A007770 (Happy numbers: numbers whose trajectory under iteration of sum of squares of digits map includes 1)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ^ Sloane, N. J. A. (ed.). "Sequence A002113 (Palindromes in base 10)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.