Base | Representation |
---|---|
bin | 11001000000101111011100… |
… | …001110001000111100110011 |
3 | 112102111002122122001010201222 |
4 | 121000233130032020330303 |
5 | 103404233301120041201 |
6 | 1025542133523215255 |
7 | 32112250431261242 |
oct | 3100573416107463 |
9 | 472432578033658 |
10 | 110002102112051 |
11 | 320606a1991086 |
12 | 1040718951752b |
13 | 494c1cc94b746 |
14 | 1d241b71ba959 |
15 | cab61904591b |
hex | 640bdc388f33 |
110002102112051 has 2 divisors, whose sum is σ = 110002102112052. Its totient is φ = 110002102112050.
The previous prime is 110002102112027. The next prime is 110002102112117. The reversal of 110002102112051 is 150211201200011.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 110002102112051 - 242 = 105604055600947 is a prime.
It is not a weakly prime, because it can be changed into another prime (110002102112351) 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, 55001051056025 + 55001051056026.
It is an arithmetic number, because the mean of its divisors is an integer number (55001051056026).
Almost surely, 2110002102112051 is an apocalyptic number.
110002102112051 is a deficient number, since it is larger than the sum of its proper divisors (1).
110002102112051 is an equidigital number, since it uses as much as digits as its factorization.
110002102112051 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 40, while the sum is 17.
Adding to 110002102112051 its reverse (150211201200011), we get a palindrome (260213303312062).
The spelling of 110002102112051 in words is "one hundred ten trillion, two billion, one hundred two million, one hundred twelve thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •