Base | Representation |
---|---|
bin | 11011110001000111000101… |
… | …100101001111001000011111 |
3 | 121000101202112111221122201122 |
4 | 123301013011211033020133 |
5 | 112001322100210000111 |
6 | 1111422043305201155 |
7 | 34503013656440564 |
oct | 3361070545171037 |
9 | 530352474848648 |
10 | 122122120000031 |
11 | 35a03778028558 |
12 | 11844102a901bb |
13 | 531b0b3149698 |
14 | 2222a5663a86b |
15 | e1ba237a1cdb |
hex | 6f11c594f21f |
122122120000031 has 2 divisors, whose sum is σ = 122122120000032. Its totient is φ = 122122120000030.
The previous prime is 122122119999977. The next prime is 122122120000037. The reversal of 122122120000031 is 130000021221221.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 122122120000031 - 218 = 122122119737887 is a prime.
It is a super-2 number, since 2×1221221200000312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 122122119999964 and 122122120000009.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (122122120000037) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61061060000015 + 61061060000016.
It is an arithmetic number, because the mean of its divisors is an integer number (61061060000016).
Almost surely, 2122122120000031 is an apocalyptic number.
122122120000031 is a deficient number, since it is larger than the sum of its proper divisors (1).
122122120000031 is an equidigital number, since it uses as much as digits as its factorization.
122122120000031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 122122120000031 its reverse (130000021221221), we get a palindrome (252122141221252).
The spelling of 122122120000031 in words is "one hundred twenty-two trillion, one hundred twenty-two billion, one hundred twenty million, thirty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •