Base | Representation |
---|---|
bin | 11001010001000000100101… |
… | …011000101100010011000111 |
3 | 112120102222012022212102022202 |
4 | 121101000211120230103013 |
5 | 104031042300401041012 |
6 | 1032155455531145115 |
7 | 32256104466061205 |
oct | 3121004530542307 |
9 | 476388168772282 |
10 | 111120021112007 |
11 | 3245181102aa46 |
12 | 1056797a2a519b |
13 | 4a0075ac3696b |
14 | 1d62348428075 |
15 | cca747beecc2 |
hex | 65102562c4c7 |
111120021112007 has 2 divisors, whose sum is σ = 111120021112008. Its totient is φ = 111120021112006.
The previous prime is 111120021111961. The next prime is 111120021112019. The reversal of 111120021112007 is 700211120021111.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 111120021112007 - 230 = 111118947370183 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 111120021112007.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (111120021112097) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55560010556003 + 55560010556004.
It is an arithmetic number, because the mean of its divisors is an integer number (55560010556004).
Almost surely, 2111120021112007 is an apocalyptic number.
111120021112007 is a deficient number, since it is larger than the sum of its proper divisors (1).
111120021112007 is an equidigital number, since it uses as much as digits as its factorization.
111120021112007 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 111120021112007 its reverse (700211120021111), we get a palindrome (811331141133118).
The spelling of 111120021112007 in words is "one hundred eleven trillion, one hundred twenty billion, twenty-one million, one hundred twelve thousand, seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •