Base | Representation |
---|---|
bin | 1011101101001100010… |
… | …1110011100010010010 |
3 | 201020002200222000221222 |
4 | 2323103011303202102 |
5 | 11243333130310002 |
6 | 232215541245042 |
7 | 20346456610526 |
oct | 2732305634222 |
9 | 636080860858 |
10 | 201110010002 |
11 | 783213a3140 |
12 | 32b87403782 |
13 | 15c70296125 |
14 | 9a3b6a7d86 |
15 | 5370b361a2 |
hex | 2ed3173892 |
201110010002 has 16 divisors (see below), whose sum is σ = 329188082400. Its totient is φ = 91386147840.
The previous prime is 201110009927. The next prime is 201110010037. The reversal of 201110010002 is 200010011102.
201110010002 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×2011100100022 (a number of 23 digits) contains 22 as substring.
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 7 ways as a sum of consecutive naturals, for example, 1299752 + ... + 1446227.
It is an arithmetic number, because the mean of its divisors is an integer number (20574255150).
Almost surely, 2201110010002 is an apocalyptic number.
201110010002 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
201110010002 is a deficient number, since it is larger than the sum of its proper divisors (128078072398).
201110010002 is a wasteful number, since it uses less digits than its factorization.
201110010002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2749321.
The product of its (nonzero) digits is 4, while the sum is 8.
Adding to 201110010002 its reverse (200010011102), we get a palindrome (401120021104).
The spelling of 201110010002 in words is "two hundred one billion, one hundred ten million, ten thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •