Base | Representation |
---|---|
bin | 11110110111010110000… |
… | …011000011000011100101 |
3 | 21111202200211111210010200 |
4 | 132313112003003003211 |
5 | 234222312030000401 |
6 | 4302213433141113 |
7 | 306144414351126 |
oct | 36672603030345 |
9 | 7452624453120 |
10 | 2121010000101 |
11 | 748573939a33 |
12 | 2a3095b5a799 |
13 | 125019a7a525 |
14 | 7492bdc804d |
15 | 3a28b98c686 |
hex | 1edd60c30e5 |
2121010000101 has 12 divisors (see below), whose sum is σ = 3070659889440. Its totient is φ = 1410785692200.
The previous prime is 2121010000099. The next prime is 2121010000129. The reversal of 2121010000101 is 1010000101212.
It is a happy number.
It is not a de Polignac number, because 2121010000101 - 21 = 2121010000099 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2121010000141) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 268410375 + ... + 268418276.
It is an arithmetic number, because the mean of its divisors is an integer number (255888324120).
Almost surely, 22121010000101 is an apocalyptic number.
It is an amenable number.
2121010000101 is a deficient number, since it is larger than the sum of its proper divisors (949649889339).
2121010000101 is a wasteful number, since it uses less digits than its factorization.
2121010000101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 536829096 (or 536829093 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 2121010000101 its reverse (1010000101212), we get a palindrome (3131010101313).
It can be divided in two parts, 212 and 1010000101, that multiplied together give a palindrome (214120021412).
The spelling of 2121010000101 in words is "two trillion, one hundred twenty-one billion, ten million, one hundred one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •