Base | Representation |
---|---|
bin | 11101001010011001000… |
… | …01011110000011010011 |
3 | 10112210100212220002201011 |
4 | 32211030201132003103 |
5 | 112404104333102402 |
6 | 2044152333551351 |
7 | 132251525600461 |
oct | 16451441360323 |
9 | 3483325802634 |
10 | 1002011222227 |
11 | 356a50237a24 |
12 | 142243645557 |
13 | 73648b71b72 |
14 | 366d75c3831 |
15 | 1b0e80e3ed7 |
hex | e94c85e0d3 |
1002011222227 has 2 divisors, whose sum is σ = 1002011222228. Its totient is φ = 1002011222226.
The previous prime is 1002011222213. The next prime is 1002011222249. The reversal of 1002011222227 is 7222221102001.
It is an a-pointer prime, because the next prime (1002011222249) can be obtained adding 1002011222227 to its sum of digits (22).
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1002011222227 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1002011222198 and 1002011222207.
It is not a weakly prime, because it can be changed into another prime (1002011222287) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 501005611113 + 501005611114.
It is an arithmetic number, because the mean of its divisors is an integer number (501005611114).
Almost surely, 21002011222227 is an apocalyptic number.
1002011222227 is a deficient number, since it is larger than the sum of its proper divisors (1).
1002011222227 is an equidigital number, since it uses as much as digits as its factorization.
1002011222227 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 448, while the sum is 22.
Adding to 1002011222227 its reverse (7222221102001), we get a palindrome (8224232324228).
The spelling of 1002011222227 in words is "one trillion, two billion, eleven million, two hundred twenty-two thousand, two hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •