Base | Representation |
---|---|
bin | 1011101101001111001… |
… | …1100101101101100001 |
3 | 201020010112112210121110 |
4 | 2323103303211231201 |
5 | 11243344213341001 |
6 | 232221050413533 |
7 | 20346663616011 |
oct | 2732363455541 |
9 | 636115483543 |
10 | 201122012001 |
11 | 78328150449 |
12 | 32b8b4312a9 |
13 | 15c72908cc1 |
14 | 9a3d10dc41 |
15 | 5371c073d6 |
hex | 2ed3ce5b61 |
201122012001 has 8 divisors (see below), whose sum is σ = 269433596704. Its totient is φ = 133445884320.
The previous prime is 201122011991. The next prime is 201122012011. The reversal of 201122012001 is 100210221102.
It is an interprime number because it is at equal distance from previous prime (201122011991) and next prime (201122012011).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 201122012001 - 222 = 201117817697 is a prime.
It is a super-2 number, since 2×2011220120012 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (201122012011) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 158863516 + ... + 158864781.
It is an arithmetic number, because the mean of its divisors is an integer number (33679199588).
Almost surely, 2201122012001 is an apocalyptic number.
It is an amenable number.
201122012001 is a deficient number, since it is larger than the sum of its proper divisors (68311584703).
201122012001 is a wasteful number, since it uses less digits than its factorization.
201122012001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 317728511.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 201122012001 its reverse (100210221102), we get a palindrome (301332233103).
The spelling of 201122012001 in words is "two hundred one billion, one hundred twenty-two million, twelve thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •