Base | Representation |
---|---|
bin | 11001010000101101111100… |
… | …101000101111010100100111 |
3 | 112120101001112201121200110011 |
4 | 121100231330220233110213 |
5 | 104030230310041200012 |
6 | 1032142350125511051 |
7 | 32254465551221305 |
oct | 3120557450572447 |
9 | 476331481550404 |
10 | 111100010100007 |
11 | 3244428236a4a5 |
12 | 10563b14712487 |
13 | 49cb8bc1a4966 |
14 | 1d613aa8b7275 |
15 | cc9e7600b1a7 |
hex | 650b7ca2f527 |
111100010100007 has 2 divisors, whose sum is σ = 111100010100008. Its totient is φ = 111100010100006.
The previous prime is 111100010099987. The next prime is 111100010100011. The reversal of 111100010100007 is 700001010001111.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 111100010100007 - 27 = 111100010099879 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 111100010100007.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (111100010100017) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55550005050003 + 55550005050004.
It is an arithmetic number, because the mean of its divisors is an integer number (55550005050004).
Almost surely, 2111100010100007 is an apocalyptic number.
111100010100007 is a deficient number, since it is larger than the sum of its proper divisors (1).
111100010100007 is an equidigital number, since it uses as much as digits as its factorization.
111100010100007 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7, while the sum is 13.
Adding to 111100010100007 its reverse (700001010001111), we get a palindrome (811101020101118).
The spelling of 111100010100007 in words is "one hundred eleven trillion, one hundred billion, ten million, one hundred thousand, seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •