Base | Representation |
---|---|
bin | 1011101100110100100… |
… | …0101101111011111000 |
3 | 201012211201222121012022 |
4 | 2323031020231323320 |
5 | 11243132042011300 |
6 | 232202012134012 |
7 | 20344134513464 |
oct | 2731510557370 |
9 | 635751877168 |
10 | 201010110200 |
11 | 7827aa6aa19 |
12 | 32b59a67308 |
13 | 15c55689113 |
14 | 9a2c3014a4 |
15 | 5366ea1285 |
hex | 2ecd22def8 |
201010110200 has 48 divisors (see below), whose sum is σ = 468413286000. Its totient is φ = 80220856320.
The previous prime is 201010110199. The next prime is 201010110209. The reversal of 201010110200 is 2011010102.
It is a super-2 number, since 2×2010101102002 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (8).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201010110209) 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, 1056905 + ... + 1232504.
It is an arithmetic number, because the mean of its divisors is an integer number (9758610125).
Almost surely, 2201010110200 is an apocalyptic number.
201010110200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
201010110200 is an abundant number, since it is smaller than the sum of its proper divisors (267403175800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201010110200 is a wasteful number, since it uses less digits than its factorization.
201010110200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2289864 (or 2289855 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 8.
Adding to 201010110200 its reverse (2011010102), we get a palindrome (203021120302).
The spelling of 201010110200 in words is "two hundred one billion, ten million, one hundred ten thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •