Base | Representation |
---|---|
bin | 10000010100111101001… |
… | …000011111011000011111 |
3 | 10222021002221201022110102 |
4 | 100110331020133120133 |
5 | 121340340044201002 |
6 | 2215240101131315 |
7 | 144030335330402 |
oct | 20247510373037 |
9 | 3867087638412 |
10 | 1122012100127 |
11 | 3a292a641686 |
12 | 1615536b9b3b |
13 | 81a612a59a9 |
14 | 3c43cab7d39 |
15 | 1e2bd1bea02 |
hex | 1053d21f61f |
1122012100127 has 2 divisors, whose sum is σ = 1122012100128. Its totient is φ = 1122012100126.
The previous prime is 1122012100007. The next prime is 1122012100129. The reversal of 1122012100127 is 7210012102211.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1122012100127 - 212 = 1122012096031 is a prime.
It is a super-2 number, since 2×11220121001272 (a number of 25 digits) contains 22 as substring.
Together with 1122012100129, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 1122012100099 and 1122012100108.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1122012100129) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 561006050063 + 561006050064.
It is an arithmetic number, because the mean of its divisors is an integer number (561006050064).
Almost surely, 21122012100127 is an apocalyptic number.
1122012100127 is a deficient number, since it is larger than the sum of its proper divisors (1).
1122012100127 is an equidigital number, since it uses as much as digits as its factorization.
1122012100127 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 112, while the sum is 20.
Adding to 1122012100127 its reverse (7210012102211), we get a palindrome (8332024202338).
The spelling of 1122012100127 in words is "one trillion, one hundred twenty-two billion, twelve million, one hundred thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •