Base | Representation |
---|---|
bin | 1011101101001111010… |
… | …0010011101000111001 |
3 | 201020010112220100122212 |
4 | 2323103310103220321 |
5 | 11243344240400441 |
6 | 232221054424505 |
7 | 20346665331323 |
oct | 2732364235071 |
9 | 636115810585 |
10 | 201122200121 |
11 | 78328269817 |
12 | 32b8b502135 |
13 | 15c7297380b |
14 | 9a3d15c613 |
15 | 5371c42eeb |
hex | 2ed3d13a39 |
201122200121 has 4 divisors (see below), whose sum is σ = 201135807012. Its totient is φ = 201108593232.
The previous prime is 201122200087. The next prime is 201122200159. The reversal of 201122200121 is 121002221102.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 153068737600 + 48053462521 = 391240^2 + 219211^2 .
It is a cyclic number.
It is not a de Polignac number, because 201122200121 - 214 = 201122183737 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 201122200096 and 201122200105.
It is not an unprimeable number, because it can be changed into a prime (201122200171) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6781250 + ... + 6810843.
It is an arithmetic number, because the mean of its divisors is an integer number (50283951753).
Almost surely, 2201122200121 is an apocalyptic number.
It is an amenable number.
201122200121 is a deficient number, since it is larger than the sum of its proper divisors (13606891).
201122200121 is a wasteful number, since it uses less digits than its factorization.
201122200121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13606890.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 201122200121 its reverse (121002221102), we get a palindrome (322124421223).
The spelling of 201122200121 in words is "two hundred one billion, one hundred twenty-two million, two hundred thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.146 sec. • engine limits •