Base | Representation |
---|---|
bin | 1011101100110110111… |
… | …0111010000000100010 |
3 | 201012212102211012121012 |
4 | 2323031232322000202 |
5 | 11243142122333442 |
6 | 232203010500522 |
7 | 20344315560032 |
oct | 2731556720042 |
9 | 635772735535 |
10 | 201020121122 |
11 | 78285688307 |
12 | 32b61294742 |
13 | 15c57782942 |
14 | 9a2d7898c2 |
15 | 5367ccc582 |
hex | 2ecdbba022 |
201020121122 has 8 divisors (see below), whose sum is σ = 307219430556. Its totient is φ = 98613644272.
The previous prime is 201020121059. The next prime is 201020121131. The reversal of 201020121122 is 221121020102.
201020121122 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 182567343841 + 18452777281 = 427279^2 + 135841^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 201020121097 and 201020121106.
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 3 ways as a sum of consecutive naturals, for example, 948208013 + ... + 948208224.
Almost surely, 2201020121122 is an apocalyptic number.
201020121122 is a deficient number, since it is larger than the sum of its proper divisors (106199309434).
201020121122 is a wasteful number, since it uses less digits than its factorization.
201020121122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1896416292.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 201020121122 its reverse (221121020102), we get a palindrome (422141141224).
The spelling of 201020121122 in words is "two hundred one billion, twenty million, one hundred twenty-one thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •