Base | Representation |
---|---|
bin | 111000110111001110… |
… | …0110001100011001101 |
3 | 102200012012111110212112 |
4 | 1301232130301203031 |
5 | 4000041200333122 |
6 | 132033022313405 |
7 | 11552023621454 |
oct | 1615634614315 |
9 | 380165443775 |
10 | 122112121037 |
11 | 478731219a5 |
12 | 1b7bb128865 |
13 | b69095a32a |
14 | 5ca5a69b9b |
15 | 329a6142e2 |
hex | 1c6e7318cd |
122112121037 has 2 divisors, whose sum is σ = 122112121038. Its totient is φ = 122112121036.
The previous prime is 122112120983. The next prime is 122112121039. The reversal of 122112121037 is 730121211221.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 84315317641 + 37796803396 = 290371^2 + 194414^2 .
It is a cyclic number.
It is not a de Polignac number, because 122112121037 - 218 = 122111858893 is a prime.
It is a super-2 number, since 2×1221121210372 (a number of 23 digits) contains 22 as substring.
Together with 122112121039, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (122112121039) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61056060518 + 61056060519.
It is an arithmetic number, because the mean of its divisors is an integer number (61056060519).
Almost surely, 2122112121037 is an apocalyptic number.
It is an amenable number.
122112121037 is a deficient number, since it is larger than the sum of its proper divisors (1).
122112121037 is an equidigital number, since it uses as much as digits as its factorization.
122112121037 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 336, while the sum is 23.
Adding to 122112121037 its reverse (730121211221), we get a palindrome (852233332258).
The spelling of 122112121037 in words is "one hundred twenty-two billion, one hundred twelve million, one hundred twenty-one thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •