Base | Representation |
---|---|
bin | 1011000110001011010110… |
… | …0111010011110000110001 |
3 | 1121012101021112100002210112 |
4 | 2301202311213103300301 |
5 | 3044344121022220142 |
6 | 41540540555111105 |
7 | 2366322026506406 |
oct | 261426547236061 |
9 | 47171245302715 |
10 | 12200754101297 |
11 | 3984346687513 |
12 | 1450707a42495 |
13 | 6a66ac011238 |
14 | 30273bcbc2ad |
15 | 1625826a2382 |
hex | b18b59d3c31 |
12200754101297 has 2 divisors, whose sum is σ = 12200754101298. Its totient is φ = 12200754101296.
The previous prime is 12200754101269. The next prime is 12200754101309. The reversal of 12200754101297 is 79210145700221.
12200754101297 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6560775082801 + 5639979018496 = 2561401^2 + 2374864^2 .
It is a cyclic number.
It is not a de Polignac number, because 12200754101297 - 230 = 12199680359473 is a prime.
It is a super-2 number, since 2×122007541012972 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (12200754101267) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6100377050648 + 6100377050649.
It is an arithmetic number, because the mean of its divisors is an integer number (6100377050649).
Almost surely, 212200754101297 is an apocalyptic number.
It is an amenable number.
12200754101297 is a deficient number, since it is larger than the sum of its proper divisors (1).
12200754101297 is an equidigital number, since it uses as much as digits as its factorization.
12200754101297 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 70560, while the sum is 41.
The spelling of 12200754101297 in words is "twelve trillion, two hundred billion, seven hundred fifty-four million, one hundred one thousand, two hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •