Base | Representation |
---|---|
bin | 1011101101001111010… |
… | …1000111111011011100 |
3 | 201020010120022020110102 |
4 | 2323103311013323130 |
5 | 11243344314224200 |
6 | 232221103200232 |
7 | 20350000212623 |
oct | 2732365077334 |
9 | 636116266412 |
10 | 201122414300 |
11 | 783283a5725 |
12 | 32b8b5a6078 |
13 | 15c72a1a152 |
14 | 9a3d1b66ba |
15 | 5371c866d5 |
hex | 2ed3d47edc |
201122414300 has 18 divisors (see below), whose sum is σ = 436435639248. Its totient is φ = 80448965680.
The previous prime is 201122414291. The next prime is 201122414309. The reversal of 201122414300 is 3414221102.
It is an interprime number because it is at equal distance from previous prime (201122414291) and next prime (201122414309).
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201122414309) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 1005611972 + ... + 1005612171.
Almost surely, 2201122414300 is an apocalyptic number.
201122414300 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
201122414300 is an abundant number, since it is smaller than the sum of its proper divisors (235313224948).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201122414300 is a wasteful number, since it uses less digits than its factorization.
201122414300 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2011224157 (or 2011224150 counting only the distinct ones).
The product of its (nonzero) digits is 384, while the sum is 20.
Adding to 201122414300 its reverse (3414221102), we get a palindrome (204536635402).
The spelling of 201122414300 in words is "two hundred one billion, one hundred twenty-two million, four hundred fourteen thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.258 sec. • engine limits •