Base | Representation |
---|---|
bin | 1011000001100110010110… |
… | …0101101111100001111001 |
3 | 1120220212021010201120022121 |
4 | 2300121211211233201321 |
5 | 3042102031114232022 |
6 | 41440452233521241 |
7 | 2360535663525406 |
oct | 260314545574171 |
9 | 46825233646277 |
10 | 12122102102137 |
11 | 3953a55683415 |
12 | 1439417573221 |
13 | 69c15624c871 |
14 | 2dc9da19b2ad |
15 | 1604cc7062c7 |
hex | b066596f879 |
12122102102137 has 2 divisors, whose sum is σ = 12122102102138. Its totient is φ = 12122102102136.
The previous prime is 12122102102107. The next prime is 12122102102179. The reversal of 12122102102137 is 73120120122121.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8909920532601 + 3212181569536 = 2984949^2 + 1792256^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12122102102137 is a prime.
It is not a weakly prime, because it can be changed into another prime (12122102102107) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6061051051068 + 6061051051069.
It is an arithmetic number, because the mean of its divisors is an integer number (6061051051069).
Almost surely, 212122102102137 is an apocalyptic number.
It is an amenable number.
12122102102137 is a deficient number, since it is larger than the sum of its proper divisors (1).
12122102102137 is an equidigital number, since it uses as much as digits as its factorization.
12122102102137 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 672, while the sum is 25.
Adding to 12122102102137 its reverse (73120120122121), we get a palindrome (85242222224258).
The spelling of 12122102102137 in words is "twelve trillion, one hundred twenty-two billion, one hundred two million, one hundred two thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •