Base | Representation |
---|---|
bin | 11011101111101000111011… |
… | …100011110011100000010111 |
3 | 121000001002120200200200020122 |
4 | 123233220323203303200113 |
5 | 111443143022122333421 |
6 | 1111303403252022155 |
7 | 34462504425602156 |
oct | 3357507343634027 |
9 | 530032520620218 |
10 | 122021020121111 |
11 | 35974907860111 |
12 | 118285a890195b |
13 | 53116c07cc417 |
14 | 221bbc54ad59d |
15 | e190a7c072ab |
hex | 6efa3b8f3817 |
122021020121111 has 2 divisors, whose sum is σ = 122021020121112. Its totient is φ = 122021020121110.
The previous prime is 122021020121107. The next prime is 122021020121149. The reversal of 122021020121111 is 111121020120221.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 122021020121111 - 22 = 122021020121107 is a prime.
It is a super-2 number, since 2×1220210201211112 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 122021020121111.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (122021020121311) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61010510060555 + 61010510060556.
It is an arithmetic number, because the mean of its divisors is an integer number (61010510060556).
Almost surely, 2122021020121111 is an apocalyptic number.
122021020121111 is a deficient number, since it is larger than the sum of its proper divisors (1).
122021020121111 is an equidigital number, since it uses as much as digits as its factorization.
122021020121111 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 122021020121111 its reverse (111121020120221), we get a palindrome (233142040241332).
The spelling of 122021020121111 in words is "one hundred twenty-two trillion, twenty-one billion, twenty million, one hundred twenty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •