Base | Representation |
---|---|
bin | 1001001100011110101011… |
… | …1101110100100100001001 |
3 | 1022210111200021212102201110 |
4 | 2103013222331310210021 |
5 | 2311120240012401441 |
6 | 33300245301240533 |
7 | 2062265141063634 |
oct | 223075275644411 |
9 | 38714607772643 |
10 | 10110000122121 |
11 | 3248699557959 |
12 | 1173476703149 |
13 | 5844a4698b93 |
14 | 26d480344c1b |
15 | 127eb7061b16 |
hex | 931eaf74909 |
10110000122121 has 16 divisors (see below), whose sum is σ = 13701983722560. Its totient is φ = 6629717515200.
The previous prime is 10110000122111. The next prime is 10110000122161. The reversal of 10110000122121 is 12122100001101.
10110000122121 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10110000122121 - 222 = 10109995927817 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 10110000122097 and 10110000122106.
It is not an unprimeable number, because it can be changed into a prime (10110000122111) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 88594530 + ... + 88708571.
It is an arithmetic number, because the mean of its divisors is an integer number (856373982660).
Almost surely, 210110000122121 is an apocalyptic number.
It is an amenable number.
10110000122121 is a deficient number, since it is larger than the sum of its proper divisors (3591983600439).
10110000122121 is a wasteful number, since it uses less digits than its factorization.
10110000122121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 177303416.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 10110000122121 its reverse (12122100001101), we get a palindrome (22232100123222).
The spelling of 10110000122121 in words is "ten trillion, one hundred ten billion, one hundred twenty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •