Base | Representation |
---|---|
bin | 1011001001000101001101… |
… | …0110000101101001101001 |
3 | 1121101011001111220202012122 |
4 | 2302101103112011221221 |
5 | 3101203310111334213 |
6 | 42015511342521025 |
7 | 2403036255415511 |
oct | 262212326055151 |
9 | 47334044822178 |
10 | 12250645027433 |
11 | 39a351882077a |
12 | 145a310296175 |
13 | 6ab3002b12c7 |
14 | 304d11d38841 |
15 | 163a0269dd08 |
hex | b2453585a69 |
12250645027433 has 2 divisors, whose sum is σ = 12250645027434. Its totient is φ = 12250645027432.
The previous prime is 12250645027427. The next prime is 12250645027477. The reversal of 12250645027433 is 33472054605221.
It is an a-pointer prime, because the next prime (12250645027477) can be obtained adding 12250645027433 to its sum of digits (44).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9527395875904 + 2723249151529 = 3086648^2 + 1650227^2 .
It is a cyclic number.
It is not a de Polignac number, because 12250645027433 - 28 = 12250645027177 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (12250645027403) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6125322513716 + 6125322513717.
It is an arithmetic number, because the mean of its divisors is an integer number (6125322513717).
Almost surely, 212250645027433 is an apocalyptic number.
It is an amenable number.
12250645027433 is a deficient number, since it is larger than the sum of its proper divisors (1).
12250645027433 is an equidigital number, since it uses as much as digits as its factorization.
12250645027433 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1209600, while the sum is 44.
The spelling of 12250645027433 in words is "twelve trillion, two hundred fifty billion, six hundred forty-five million, twenty-seven thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •