Base | Representation |
---|---|
bin | 11011110101001010001011… |
… | …110001100000010111011001 |
3 | 121001101100121221222222010212 |
4 | 123311022023301200113121 |
5 | 112020401330142341212 |
6 | 1112153533201220505 |
7 | 34532063052145316 |
oct | 3365121361402731 |
9 | 531340557888125 |
10 | 122400323012057 |
11 | 3600075a409102 |
12 | 1188a004631735 |
13 | 533b3bb1c656c |
14 | 22322c8965d0d |
15 | e23da7583e22 |
hex | 6f528bc605d9 |
122400323012057 has 2 divisors, whose sum is σ = 122400323012058. Its totient is φ = 122400323012056.
The previous prime is 122400323011999. The next prime is 122400323012059. The reversal of 122400323012057 is 750210323004221.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 96713377815616 + 25686945196441 = 9834296^2 + 5068229^2 .
It is a cyclic number.
It is not a de Polignac number, because 122400323012057 - 228 = 122400054576601 is a prime.
Together with 122400323012059, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (122400323012059) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61200161506028 + 61200161506029.
It is an arithmetic number, because the mean of its divisors is an integer number (61200161506029).
Almost surely, 2122400323012057 is an apocalyptic number.
It is an amenable number.
122400323012057 is a deficient number, since it is larger than the sum of its proper divisors (1).
122400323012057 is an equidigital number, since it uses as much as digits as its factorization.
122400323012057 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 20160, while the sum is 32.
Adding to 122400323012057 its reverse (750210323004221), we get a palindrome (872610646016278).
The spelling of 122400323012057 in words is "one hundred twenty-two trillion, four hundred billion, three hundred twenty-three million, twelve thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •