Base | Representation |
---|---|
bin | 1001001100100010110100… |
… | …1111010011101001001111 |
3 | 1022210121112210001210100102 |
4 | 2103020231033103221033 |
5 | 2311130024133032002 |
6 | 33300551500521315 |
7 | 2062334531646413 |
oct | 223105517235117 |
9 | 38717483053312 |
10 | 10111112002127 |
11 | 324910a146854 |
12 | 1173726b5023b |
13 | 584620b49046 |
14 | 26d547c96d43 |
15 | 12802e992a02 |
hex | 9322d3d3a4f |
10111112002127 has 2 divisors, whose sum is σ = 10111112002128. Its totient is φ = 10111112002126.
The previous prime is 10111112002091. The next prime is 10111112002133. The reversal of 10111112002127 is 72120021111101.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 10111112002127 - 210 = 10111112001103 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10111112002099 and 10111112002108.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10111112002157) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5055556001063 + 5055556001064.
It is an arithmetic number, because the mean of its divisors is an integer number (5055556001064).
Almost surely, 210111112002127 is an apocalyptic number.
10111112002127 is a deficient number, since it is larger than the sum of its proper divisors (1).
10111112002127 is an equidigital number, since it uses as much as digits as its factorization.
10111112002127 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 56, while the sum is 20.
Adding to 10111112002127 its reverse (72120021111101), we get a palindrome (82231133113228).
The spelling of 10111112002127 in words is "ten trillion, one hundred eleven billion, one hundred twelve million, two thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •