Base | Representation |
---|---|
bin | 10110101111010110101100… |
… | …101101100101110111111001 |
3 | 111010002222102021000102212212 |
4 | 112233112230231211313321 |
5 | 101102040430021320441 |
6 | 552412303251544505 |
7 | 30031400021115530 |
oct | 2657265455456771 |
9 | 433088367012785 |
10 | 100011211120121 |
11 | 29959575432704 |
12 | b272a142bb135 |
13 | 43a602aa1c232 |
14 | 1a9a7d5b5b317 |
15 | b867c3b62eeb |
hex | 5af5acb65df9 |
100011211120121 has 8 divisors (see below), whose sum is σ = 114301424537664. Its totient is φ = 85721722088400.
The previous prime is 100011211120063. The next prime is 100011211120189. The reversal of 100011211120121 is 121021112110001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-100011211120121 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 100011211120096 and 100011211120105.
It is not an unprimeable number, because it can be changed into a prime (100011211120421) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 180800570 + ... + 181352883.
It is an arithmetic number, because the mean of its divisors is an integer number (14287678067208).
Almost surely, 2100011211120121 is an apocalyptic number.
It is an amenable number.
100011211120121 is a deficient number, since it is larger than the sum of its proper divisors (14290213417543).
100011211120121 is an equidigital number, since it uses as much as digits as its factorization.
100011211120121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 362192911.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 100011211120121 its reverse (121021112110001), we get a palindrome (221032323230122).
The spelling of 100011211120121 in words is "one hundred trillion, eleven billion, two hundred eleven million, one hundred twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •