Base | Representation |
---|---|
bin | 1011000000111101101111… |
… | …0010010010110110011001 |
3 | 1120212211010100212122222112 |
4 | 2300033123302102312121 |
5 | 3041412214222432022 |
6 | 41431450352202105 |
7 | 2360001555102401 |
oct | 260173362226631 |
9 | 46784110778875 |
10 | 12111200202137 |
11 | 394a370859603 |
12 | 1437294539335 |
13 | 69b109751c6a |
14 | 2dc284345801 |
15 | 1600905938e2 |
hex | b03dbc92d99 |
12111200202137 has 2 divisors, whose sum is σ = 12111200202138. Its totient is φ = 12111200202136.
The previous prime is 12111200202109. The next prime is 12111200202169. The reversal of 12111200202137 is 73120200211121.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9847728095881 + 2263472106256 = 3138109^2 + 1504484^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12111200202137 is a prime.
It is not a weakly prime, because it can be changed into another prime (12111250202137) 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, 6055600101068 + 6055600101069.
It is an arithmetic number, because the mean of its divisors is an integer number (6055600101069).
Almost surely, 212111200202137 is an apocalyptic number.
It is an amenable number.
12111200202137 is a deficient number, since it is larger than the sum of its proper divisors (1).
12111200202137 is an equidigital number, since it uses as much as digits as its factorization.
12111200202137 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 336, while the sum is 23.
Adding to 12111200202137 its reverse (73120200211121), we get a palindrome (85231400413258).
The spelling of 12111200202137 in words is "twelve trillion, one hundred eleven billion, two hundred million, two hundred two thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •