Base | Representation |
---|---|
bin | 1011101101001111010… |
… | …0000000000110111000 |
3 | 201020010112202021220212 |
4 | 2323103310000012320 |
5 | 11243344230320440 |
6 | 232221053010252 |
7 | 20346664546145 |
oct | 2732364000670 |
9 | 636115667825 |
10 | 201122120120 |
11 | 783282146a9 |
12 | 32b8b483988 |
13 | 15c7294628c |
14 | 9a3d13b3cc |
15 | 5371c29465 |
hex | 2ed3d001b8 |
201122120120 has 64 divisors (see below), whose sum is σ = 458477547840. Its totient is φ = 79395712000.
The previous prime is 201122120093. The next prime is 201122120131. The reversal of 201122120120 is 21021221102.
It is a junction number, because it is equal to n+sod(n) for n = 201122120095 and 201122120104.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1176404 + ... + 1336476.
It is an arithmetic number, because the mean of its divisors is an integer number (7163711685).
Almost surely, 2201122120120 is an apocalyptic number.
201122120120 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
201122120120 is an abundant number, since it is smaller than the sum of its proper divisors (257355427720).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201122120120 is a wasteful number, since it uses less digits than its factorization.
201122120120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 160496 (or 160492 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 201122120120 its reverse (21021221102), we get a palindrome (222143341222).
The spelling of 201122120120 in words is "two hundred one billion, one hundred twenty-two million, one hundred twenty thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •