Base | Representation |
---|---|
bin | 1001001011111101001100… |
… | …1011000101101000011001 |
3 | 1022202122110211021022222110 |
4 | 2102333103023011220121 |
5 | 2310443332304341441 |
6 | 33252201305342533 |
7 | 2061526316650101 |
oct | 222772313055031 |
9 | 38678424238873 |
10 | 10101011012121 |
11 | 32448a6424527 |
12 | 1171788197a49 |
13 | 5836a125c593 |
14 | 26cc6a566201 |
15 | 127b3ccd6b16 |
hex | 92fd32c5a19 |
10101011012121 has 32 divisors (see below), whose sum is σ = 13929867110016. Its totient is φ = 6507970560000.
The previous prime is 10101011012047. The next prime is 10101011012123. The reversal of 10101011012121 is 12121011010101.
10101011012121 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 10101011012121 - 211 = 10101011010073 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 10101011012097 and 10101011012106.
It is not an unprimeable number, because it can be changed into a prime (10101011012123) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 335385 + ... + 4507161.
It is an arithmetic number, because the mean of its divisors is an integer number (435308347188).
Almost surely, 210101011012121 is an apocalyptic number.
It is an amenable number.
10101011012121 is a deficient number, since it is larger than the sum of its proper divisors (3828856097895).
10101011012121 is a wasteful number, since it uses less digits than its factorization.
10101011012121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4172073.
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 10101011012121 its reverse (12121011010101), we get a palindrome (22222022022222).
The spelling of 10101011012121 in words is "ten trillion, one hundred one billion, eleven million, twelve thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •