Base | Representation |
---|---|
bin | 1010000111010001101001… |
… | …0101010011100010001111 |
3 | 1110101001221201210200021111 |
4 | 2201310122111103202033 |
5 | 2424142442200400444 |
6 | 35352301535112451 |
7 | 2225254513316116 |
oct | 241643225234217 |
9 | 43331851720244 |
10 | 11120112121999 |
11 | 35a8016434a41 |
12 | 12b719b072727 |
13 | 6288119075aa |
14 | 2a6305746c7d |
15 | 1443d640b234 |
hex | a1d1a55388f |
11120112121999 has 2 divisors, whose sum is σ = 11120112122000. Its totient is φ = 11120112121998.
The previous prime is 11120112121991. The next prime is 11120112122051. The reversal of 11120112121999 is 99912121102111.
It is a happy number.
It is a weak prime.
It is an emirp because it is prime and its reverse (99912121102111) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11120112121999 - 23 = 11120112121991 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11120112121991) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5560056060999 + 5560056061000.
It is an arithmetic number, because the mean of its divisors is an integer number (5560056061000).
Almost surely, 211120112121999 is an apocalyptic number.
11120112121999 is a deficient number, since it is larger than the sum of its proper divisors (1).
11120112121999 is an equidigital number, since it uses as much as digits as its factorization.
11120112121999 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5832, while the sum is 40.
The spelling of 11120112121999 in words is "eleven trillion, one hundred twenty billion, one hundred twelve million, one hundred twenty-one thousand, nine hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •