Base | Representation |
---|---|
bin | 1011101101001111010… |
… | …0000000001000011101 |
3 | 201020010112202022001121 |
4 | 2323103310000020131 |
5 | 11243344230321341 |
6 | 232221053010541 |
7 | 20346664546351 |
oct | 2732364001035 |
9 | 636115668047 |
10 | 201122120221 |
11 | 78328214790 |
12 | 32b8b483a51 |
13 | 15c72946339 |
14 | 9a3d13b461 |
15 | 5371c294d1 |
hex | 2ed3d0021d |
201122120221 has 16 divisors (see below), whose sum is σ = 223045877376. Its totient is φ = 179829000000.
The previous prime is 201122120197. The next prime is 201122120233. The reversal of 201122120221 is 122021221102.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 201122120221 - 27 = 201122120093 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 201122120195 and 201122120204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201122127221) by changing a digit.
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, 431670 + ... + 767191.
It is an arithmetic number, because the mean of its divisors is an integer number (13940367336).
Almost surely, 2201122120221 is an apocalyptic number.
It is an amenable number.
201122120221 is a deficient number, since it is larger than the sum of its proper divisors (21923757155).
201122120221 is a wasteful number, since it uses less digits than its factorization.
201122120221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1199124.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 201122120221 its reverse (122021221102), we get a palindrome (323143341323).
The spelling of 201122120221 in words is "two hundred one billion, one hundred twenty-two million, one hundred twenty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •