Base | Representation |
---|---|
bin | 11000011001001100000010… |
… | …00101011001111100110101 |
3 | 21000221010102001201101122222 |
4 | 30030212001011121330311 |
5 | 24012332320113100441 |
6 | 310030444503132125 |
7 | 14204336032565063 |
oct | 1414460105317465 |
9 | 230833361641588 |
10 | 53642012237621 |
11 | 161014a45112a5 |
12 | 6024221444045 |
13 | 23c155cb03182 |
14 | d364042b5033 |
15 | 6305426d6d4b |
hex | 30c981159f35 |
53642012237621 has 2 divisors, whose sum is σ = 53642012237622. Its totient is φ = 53642012237620.
The previous prime is 53642012237599. The next prime is 53642012237623. The reversal of 53642012237621 is 12673221024635.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 36780222208900 + 16861790028721 = 6064670^2 + 4106311^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-53642012237621 is a prime.
It is a super-2 number, since 2×536420122376212 (a number of 28 digits) contains 22 as substring.
Together with 53642012237623, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (53642012237623) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 26821006118810 + 26821006118811.
It is an arithmetic number, because the mean of its divisors is an integer number (26821006118811).
Almost surely, 253642012237621 is an apocalyptic number.
It is an amenable number.
53642012237621 is a deficient number, since it is larger than the sum of its proper divisors (1).
53642012237621 is an equidigital number, since it uses as much as digits as its factorization.
53642012237621 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 725760, while the sum is 44.
The spelling of 53642012237621 in words is "fifty-three trillion, six hundred forty-two billion, twelve million, two hundred thirty-seven thousand, six hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •