Base | Representation |
---|---|
bin | 111000110100001101… |
… | …1011101011001000111 |
3 | 102122221011102201221021 |
4 | 1301220123131121013 |
5 | 3444334321104111 |
6 | 132015013332011 |
7 | 11546356230463 |
oct | 1615033353107 |
9 | 378834381837 |
10 | 122011113031 |
11 | 47821102105 |
12 | 1b791337007 |
13 | b675a52a92 |
14 | 5c964954a3 |
15 | 3291810d71 |
hex | 1c686dd647 |
122011113031 has 2 divisors, whose sum is σ = 122011113032. Its totient is φ = 122011113030.
The previous prime is 122011112999. The next prime is 122011113047. The reversal of 122011113031 is 130311110221.
It is a happy number.
It is an a-pointer prime, because the next prime (122011113047) can be obtained adding 122011113031 to its sum of digits (16).
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 122011113031 - 25 = 122011112999 is a prime.
It is a super-2 number, since 2×1220111130312 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 122011112996 and 122011113014.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (122011113071) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61005556515 + 61005556516.
It is an arithmetic number, because the mean of its divisors is an integer number (61005556516).
Almost surely, 2122011113031 is an apocalyptic number.
122011113031 is a deficient number, since it is larger than the sum of its proper divisors (1).
122011113031 is an equidigital number, since it uses as much as digits as its factorization.
122011113031 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 122011113031 its reverse (130311110221), we get a palindrome (252322223252).
The spelling of 122011113031 in words is "one hundred twenty-two billion, eleven million, one hundred thirteen thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •