Base | Representation |
---|---|
bin | 1011000110111101110100… |
… | …1100000000101111100101 |
3 | 1121020200020202212012222121 |
4 | 2301233131030000233211 |
5 | 3100104343022423122 |
6 | 41551101233425541 |
7 | 2400311545633336 |
oct | 261573514005745 |
9 | 47220222765877 |
10 | 12214302936037 |
11 | 398a0696435a4 |
12 | 145326940b2b1 |
13 | 6a7a5b005c07 |
14 | 3032654b228d |
15 | 162ac6db6bc7 |
hex | b1bdd300be5 |
12214302936037 has 2 divisors, whose sum is σ = 12214302936038. Its totient is φ = 12214302936036.
The previous prime is 12214302936007. The next prime is 12214302936071. The reversal of 12214302936037 is 73063920341221.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8278360401796 + 3935942534241 = 2877214^2 + 1983921^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12214302936037 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12214302935984 and 12214302936002.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12214302936007) 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, 6107151468018 + 6107151468019.
It is an arithmetic number, because the mean of its divisors is an integer number (6107151468019).
Almost surely, 212214302936037 is an apocalyptic number.
It is an amenable number.
12214302936037 is a deficient number, since it is larger than the sum of its proper divisors (1).
12214302936037 is an equidigital number, since it uses as much as digits as its factorization.
12214302936037 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 326592, while the sum is 43.
The spelling of 12214302936037 in words is "twelve trillion, two hundred fourteen billion, three hundred two million, nine hundred thirty-six thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •