Base | Representation |
---|---|
bin | 111111001101100… |
… | …0011001100110010 |
3 | 12110211001222202002 |
4 | 1332123003030302 |
5 | 13320440121320 |
6 | 550244454002 |
7 | 103363242251 |
oct | 17633031462 |
9 | 5424058662 |
10 | 2121020210 |
11 | 999295971 |
12 | 4b23aa302 |
13 | 27a56a75a |
14 | 16199c798 |
15 | c631a675 |
hex | 7e6c3332 |
2121020210 has 24 divisors (see below), whose sum is σ = 3991056300. Its totient is φ = 811518752.
The previous prime is 2121020201. The next prime is 2121020219. The reversal of 2121020210 is 120201212.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (2121020201) and next prime (2121020219).
It can be written as a sum of positive squares in 2 ways, for example, as 1903664161 + 217356049 = 43631^2 + 14743^2 .
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 2121020191 and 2121020200.
It is not an unprimeable number, because it can be changed into a prime (2121020219) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 195185 + ... + 205764.
Almost surely, 22121020210 is an apocalyptic number.
2121020210 is a deficient number, since it is larger than the sum of its proper divisors (1870036090).
2121020210 is a wasteful number, since it uses less digits than its factorization.
2121020210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 401002 (or 400979 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 11.
The square root of 2121020210 is about 46054.5351729881. The cubic root of 2121020210 is about 1284.8376929148.
Adding to 2121020210 its reverse (120201212), we get a palindrome (2241221422).
The spelling of 2121020210 in words is "two billion, one hundred twenty-one million, twenty thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •