Base | Representation |
---|---|
bin | 1001001101001000000100… |
… | …1110111000000111011111 |
3 | 1022211120100122011002212011 |
4 | 2103102001032320013133 |
5 | 2311311013421010421 |
6 | 33305324012252051 |
7 | 2063140365654631 |
oct | 223220116700737 |
9 | 38746318132764 |
10 | 10121111110111 |
11 | 3252380401661 |
12 | 1175657771027 |
13 | 5855555b34a1 |
14 | 26dc15c66a51 |
15 | 1284177264e1 |
hex | 934813b81df |
10121111110111 has 8 divisors (see below), whose sum is σ = 10184802728240. Its totient is φ = 10057438991232.
The previous prime is 10121111110093. The next prime is 10121111110171. The reversal of 10121111110111 is 11101111112101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10121111110111 - 211 = 10121111108063 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10121111110091 and 10121111110100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10121111110171) 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, 3832746 + ... + 5910343.
It is an arithmetic number, because the mean of its divisors is an integer number (1273100341030).
Almost surely, 210121111110111 is an apocalyptic number.
10121111110111 is a deficient number, since it is larger than the sum of its proper divisors (63691618129).
10121111110111 is an equidigital number, since it uses as much as digits as its factorization.
10121111110111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9749625.
The product of its (nonzero) digits is 2, while the sum is 13.
Adding to 10121111110111 its reverse (11101111112101), we get a palindrome (21222222222212).
The spelling of 10121111110111 in words is "ten trillion, one hundred twenty-one billion, one hundred eleven million, one hundred ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •