Base | Representation |
---|---|
bin | 11011100011101101010101… |
… | …001010101110010000101111 |
3 | 120220010201020211000210120011 |
4 | 123203231111022232100233 |
5 | 111341224333404000421 |
6 | 1105435004410034051 |
7 | 34346330342216452 |
oct | 3343552512562057 |
9 | 526121224023504 |
10 | 121201111000111 |
11 | 356891144a910a |
12 | 11715706a18927 |
13 | 52822a5c4719c |
14 | 21d0244d5b499 |
15 | e02abbb4b4e1 |
hex | 6e3b552ae42f |
121201111000111 has 2 divisors, whose sum is σ = 121201111000112. Its totient is φ = 121201111000110.
The previous prime is 121201111000091. The next prime is 121201111000183. The reversal of 121201111000111 is 111000111102121.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 121201111000111 - 211 = 121201110998063 is a prime.
It is a super-2 number, since 2×1212011110001112 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 121201111000091 and 121201111000100.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (121201111004111) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60600555500055 + 60600555500056.
It is an arithmetic number, because the mean of its divisors is an integer number (60600555500056).
Almost surely, 2121201111000111 is an apocalyptic number.
121201111000111 is a deficient number, since it is larger than the sum of its proper divisors (1).
121201111000111 is an equidigital number, since it uses as much as digits as its factorization.
121201111000111 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 121201111000111 its reverse (111000111102121), we get a palindrome (232201222102232).
The spelling of 121201111000111 in words is "one hundred twenty-one trillion, two hundred one billion, one hundred eleven million, one hundred eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •