Base | Representation |
---|---|
bin | 11001000001000000001000… |
… | …001110010000100111001111 |
3 | 112102112210220101002211110001 |
4 | 121001000020032100213033 |
5 | 103410032000133211002 |
6 | 1025554255522225131 |
7 | 32113453443506236 |
oct | 3101001016204717 |
9 | 472483811084401 |
10 | 110020020210127 |
11 | 320682572133a5 |
12 | 1040a74a1b51a7 |
13 | 4950ac6c04041 |
14 | 1d24dd6ba7b1d |
15 | cabd17121a87 |
hex | 6410083909cf |
110020020210127 has 2 divisors, whose sum is σ = 110020020210128. Its totient is φ = 110020020210126.
The previous prime is 110020020210097. The next prime is 110020020210137. The reversal of 110020020210127 is 721012020020011.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 110020020210127 - 243 = 101223927187919 is a prime.
It is a super-2 number, since 2×1100200202101272 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110020020210137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55010010105063 + 55010010105064.
It is an arithmetic number, because the mean of its divisors is an integer number (55010010105064).
Almost surely, 2110020020210127 is an apocalyptic number.
110020020210127 is a deficient number, since it is larger than the sum of its proper divisors (1).
110020020210127 is an equidigital number, since it uses as much as digits as its factorization.
110020020210127 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 19.
Adding to 110020020210127 its reverse (721012020020011), we get a palindrome (831032040230138).
The spelling of 110020020210127 in words is "one hundred ten trillion, twenty billion, twenty million, two hundred ten thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •