Base | Representation |
---|---|
bin | 1011101101001110111… |
… | …1110011110001010010 |
3 | 201020010110200110020002 |
4 | 2323103233303301102 |
5 | 11243343440133020 |
6 | 232221013250002 |
7 | 20346652320560 |
oct | 2732357636122 |
9 | 636113613202 |
10 | 201121021010 |
11 | 78327633948 |
12 | 32b8b033902 |
13 | 15c7264cc10 |
14 | 9a3cd32a30 |
15 | 5371aad975 |
hex | 2ed3bf3c52 |
201121021010 has 32 divisors (see below), whose sum is σ = 445560417792. Its totient is φ = 63651487680.
The previous prime is 201121020911. The next prime is 201121021061. The reversal of 201121021010 is 10120121102.
It is a super-2 number, since 2×2011210210102 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 201121020982 and 201121021000.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 110505146 + ... + 110506965.
It is an arithmetic number, because the mean of its divisors is an integer number (13923763056).
Almost surely, 2201121021010 is an apocalyptic number.
201121021010 is an abundant number, since it is smaller than the sum of its proper divisors (244439396782).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201121021010 is a wasteful number, since it uses less digits than its factorization.
201121021010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 221012138.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 201121021010 its reverse (10120121102), we get a palindrome (211241142112).
The spelling of 201121021010 in words is "two hundred one billion, one hundred twenty-one million, twenty-one thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •