Base | Representation |
---|---|
bin | 11001000000101111010111… |
… | …011000110011010111000111 |
3 | 112102111002102222110021220102 |
4 | 121000233113120303113013 |
5 | 103404233114340134002 |
6 | 1025542121505154315 |
7 | 32112245425102454 |
oct | 3100572730632707 |
9 | 472432388407812 |
10 | 110002021021127 |
11 | 32060660135294 |
12 | 1040716632b99b |
13 | 494c1b8bc8951 |
14 | 1d241aa50c82b |
15 | cab611d78a02 |
hex | 640bd76335c7 |
110002021021127 has 2 divisors, whose sum is σ = 110002021021128. Its totient is φ = 110002021021126.
The previous prime is 110002021021091. The next prime is 110002021021133. The reversal of 110002021021127 is 721120120200011.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 110002021021127 - 210 = 110002021020103 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 110002021021099 and 110002021021108.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110002021021027) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55001010510563 + 55001010510564.
It is an arithmetic number, because the mean of its divisors is an integer number (55001010510564).
Almost surely, 2110002021021127 is an apocalyptic number.
110002021021127 is a deficient number, since it is larger than the sum of its proper divisors (1).
110002021021127 is an equidigital number, since it uses as much as digits as its factorization.
110002021021127 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 110002021021127 its reverse (721120120200011), we get a palindrome (831122141221138).
The spelling of 110002021021127 in words is "one hundred ten trillion, two billion, twenty-one million, twenty-one thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •