Base | Representation |
---|---|
bin | 1011101100110010101… |
… | …0001101000011101010 |
3 | 201012211011221012122102 |
4 | 2323030222031003222 |
5 | 11243123020024320 |
6 | 232201124453402 |
7 | 20344006520015 |
oct | 2731452150352 |
9 | 635734835572 |
10 | 201002111210 |
11 | 782764a718a |
12 | 32b5724a262 |
13 | 15c53b182a4 |
14 | 9a2b21c37c |
15 | 5366421175 |
hex | 2ecca8d0ea |
201002111210 has 32 divisors (see below), whose sum is σ = 362817187200. Its totient is φ = 80175955392.
The previous prime is 201002111147. The next prime is 201002111227. The reversal of 201002111210 is 12111200102.
201002111210 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 201002111191 and 201002111200.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5414432 + ... + 5451428.
It is an arithmetic number, because the mean of its divisors is an integer number (11338037100).
Almost surely, 2201002111210 is an apocalyptic number.
201002111210 is a deficient number, since it is larger than the sum of its proper divisors (161815075990).
201002111210 is a wasteful number, since it uses less digits than its factorization.
201002111210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38510.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 201002111210 its reverse (12111200102), we get a palindrome (213113311312).
The spelling of 201002111210 in words is "two hundred one billion, two million, one hundred eleven thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •