Base | Representation |
---|---|
bin | 11000001101101011001100… |
… | …10100000110111110100001 |
3 | 20222112022022222122021112012 |
4 | 30012311212110012332201 |
5 | 23434342140041203001 |
6 | 305125023115442305 |
7 | 14133633035204126 |
oct | 1406654624067641 |
9 | 228468288567465 |
10 | 53246426116001 |
11 | 15a69756458078 |
12 | 5b7b620456395 |
13 | 2393168a76ab1 |
14 | d211d840074d |
15 | 6250dd5692bb |
hex | 306d66506fa1 |
53246426116001 has 2 divisors, whose sum is σ = 53246426116002. Its totient is φ = 53246426116000.
The previous prime is 53246426115983. The next prime is 53246426116003. The reversal of 53246426116001 is 10061162464235.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 37425959640976 + 15820466475025 = 6117676^2 + 3977495^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-53246426116001 is a prime.
Together with 53246426116003, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 53246426116001.
It is not a weakly prime, because it can be changed into another prime (53246426116003) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 26623213058000 + 26623213058001.
It is an arithmetic number, because the mean of its divisors is an integer number (26623213058001).
Almost surely, 253246426116001 is an apocalyptic number.
It is an amenable number.
53246426116001 is a deficient number, since it is larger than the sum of its proper divisors (1).
53246426116001 is an equidigital number, since it uses as much as digits as its factorization.
53246426116001 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 207360, while the sum is 41.
The spelling of 53246426116001 in words is "fifty-three trillion, two hundred forty-six billion, four hundred twenty-six million, one hundred sixteen thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •