Base | Representation |
---|---|
bin | 1011101101001010001… |
… | …1111001101001001001 |
3 | 201020002002020111002012 |
4 | 2323102203321221021 |
5 | 11243323341401441 |
6 | 232215022545305 |
7 | 20346321222404 |
oct | 2732243715111 |
9 | 636062214065 |
10 | 201101122121 |
11 | 78317382589 |
12 | 32b84438235 |
13 | 15c6b4a3823 |
14 | 9a3a432d3b |
15 | 536ee7c9eb |
hex | 2ed28f9a49 |
201101122121 has 2 divisors, whose sum is σ = 201101122122. Its totient is φ = 201101122120.
The previous prime is 201101122099. The next prime is 201101122139. The reversal of 201101122121 is 121221101102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 125786552896 + 75314569225 = 354664^2 + 274435^2 .
It is a cyclic number.
It is not a de Polignac number, because 201101122121 - 222 = 201096927817 is a prime.
It is a super-2 number, since 2×2011011221212 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 201101122096 and 201101122105.
It is not a weakly prime, because it can be changed into another prime (201101122151) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100550561060 + 100550561061.
It is an arithmetic number, because the mean of its divisors is an integer number (100550561061).
Almost surely, 2201101122121 is an apocalyptic number.
It is an amenable number.
201101122121 is a deficient number, since it is larger than the sum of its proper divisors (1).
201101122121 is an equidigital number, since it uses as much as digits as its factorization.
201101122121 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 201101122121 its reverse (121221101102), we get a palindrome (322322223223).
The spelling of 201101122121 in words is "two hundred one billion, one hundred one million, one hundred twenty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •