Base | Representation |
---|---|
bin | 1001001101001000000100… |
… | …1110111000100110100110 |
3 | 1022211120100122011012120220 |
4 | 2103102001032320212212 |
5 | 2311311013421041402 |
6 | 33305324012305210 |
7 | 2063140365663504 |
oct | 223220116704646 |
9 | 38746318135526 |
10 | 10121111112102 |
11 | 3252380403101 |
12 | 1175657772206 |
13 | 5855555b4373 |
14 | 26dc15c67674 |
15 | 128417726dbc |
hex | 934813b89a6 |
10121111112102 has 32 divisors (see below), whose sum is σ = 20413769362272. Its totient is φ = 3345169987584.
The previous prime is 10121111112071. The next prime is 10121111112103. The reversal of 10121111112102 is 20121111112101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10121111112103) 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 in 15 ways as a sum of consecutive naturals, for example, 6479203 + ... + 7888110.
It is an arithmetic number, because the mean of its divisors is an integer number (637930292571).
Almost surely, 210121111112102 is an apocalyptic number.
10121111112102 is an abundant number, since it is smaller than the sum of its proper divisors (10292658250170).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10121111112102 is a wasteful number, since it uses less digits than its factorization.
10121111112102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14368312.
The product of its (nonzero) digits is 8, while the sum is 15.
Adding to 10121111112102 its reverse (20121111112101), we get a palindrome (30242222224203).
Subtracting 10121111112102 from its reverse (20121111112101), we obtain a palindrome (9999999999999).
The spelling of 10121111112102 in words is "ten trillion, one hundred twenty-one billion, one hundred eleven million, one hundred twelve thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •