Base | Representation |
---|---|
bin | 1001001101001000000010… |
… | …1100100010110110011111 |
3 | 1022211120100000012212011211 |
4 | 2103102000230202312133 |
5 | 2311311004120010421 |
6 | 33305323051325251 |
7 | 2063140226321566 |
oct | 223220054426637 |
9 | 38746300185154 |
10 | 10121102110111 |
11 | 3252376314843 |
12 | 1175654750827 |
13 | 585553781b45 |
14 | 26dc149a2bdd |
15 | 128416a499e1 |
hex | 93480b22d9f |
10121102110111 has 4 divisors (see below), whose sum is σ = 10356476577832. Its totient is φ = 9885727642392.
The previous prime is 10121102110109. The next prime is 10121102110177. The reversal of 10121102110111 is 11101120112101.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 10121102110111 - 21 = 10121102110109 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10121102110091 and 10121102110100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10121102110211) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 117687233796 + ... + 117687233881.
It is an arithmetic number, because the mean of its divisors is an integer number (2589119144458).
Almost surely, 210121102110111 is an apocalyptic number.
10121102110111 is a deficient number, since it is larger than the sum of its proper divisors (235374467721).
10121102110111 is an equidigital number, since it uses as much as digits as its factorization.
10121102110111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 235374467720.
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 10121102110111 its reverse (11101120112101), we get a palindrome (21222222222212).
The spelling of 10121102110111 in words is "ten trillion, one hundred twenty-one billion, one hundred two million, one hundred ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •