Base | Representation |
---|---|
bin | 11011101111010110011000… |
… | …010110001111101011100111 |
3 | 120222222012011120020211221212 |
4 | 123233112120112033223213 |
5 | 111442331224103323421 |
6 | 1111250311005502035 |
7 | 34461201016502501 |
oct | 3357263026175347 |
9 | 528865146224855 |
10 | 122001102011111 |
11 | 35967416583284 |
12 | 1182476a27191b |
13 | 530c86809720b |
14 | 221ac56022d71 |
15 | e187de264e5b |
hex | 6ef59858fae7 |
122001102011111 has 2 divisors, whose sum is σ = 122001102011112. Its totient is φ = 122001102011110.
The previous prime is 122001102011083. The next prime is 122001102011153. The reversal of 122001102011111 is 111110201100221.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 122001102011111 - 234 = 121983922141927 is a prime.
It is a super-3 number, since 3×1220011020111113 (a number of 43 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (122001102011611) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61000551005555 + 61000551005556.
It is an arithmetic number, because the mean of its divisors is an integer number (61000551005556).
Almost surely, 2122001102011111 is an apocalyptic number.
122001102011111 is a deficient number, since it is larger than the sum of its proper divisors (1).
122001102011111 is an equidigital number, since it uses as much as digits as its factorization.
122001102011111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 122001102011111 its reverse (111110201100221), we get a palindrome (233111303111332).
The spelling of 122001102011111 in words is "one hundred twenty-two trillion, one billion, one hundred two million, eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •