Base | Representation |
---|---|
bin | 11011110000111101101011… |
… | …001011001111100100001111 |
3 | 121000100210110011102012110111 |
4 | 123300331223023033210033 |
5 | 112001140400401131111 |
6 | 1111413252351420451 |
7 | 34502205345066004 |
oct | 3360755313174417 |
9 | 530323404365414 |
10 | 122112013302031 |
11 | 359aa461067785 |
12 | 11842162224727 |
13 | 531a162311acc |
14 | 22223782618ab |
15 | e1b631369a21 |
hex | 6f0f6b2cf90f |
122112013302031 has 2 divisors, whose sum is σ = 122112013302032. Its totient is φ = 122112013302030.
The previous prime is 122112013302007. The next prime is 122112013302079. The reversal of 122112013302031 is 130203310211221.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-122112013302031 is a prime.
It is a super-2 number, since 2×1221120133020312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 122112013301993 and 122112013302011.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (122112013308031) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61056006651015 + 61056006651016.
It is an arithmetic number, because the mean of its divisors is an integer number (61056006651016).
Almost surely, 2122112013302031 is an apocalyptic number.
122112013302031 is a deficient number, since it is larger than the sum of its proper divisors (1).
122112013302031 is an equidigital number, since it uses as much as digits as its factorization.
122112013302031 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 122112013302031 its reverse (130203310211221), we get a palindrome (252315323513252).
The spelling of 122112013302031 in words is "one hundred twenty-two trillion, one hundred twelve billion, thirteen million, three hundred two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •