Base | Representation |
---|---|
bin | 101001001101110010110… |
… | …0001011011010101010101 |
3 | 202001112100221110110200112 |
4 | 1102123211201123111111 |
5 | 1220302114104010201 |
6 | 20014142303052405 |
7 | 1123153335334013 |
oct | 122334541332525 |
9 | 22045327413615 |
10 | 5664617641301 |
11 | 1894394a893a3 |
12 | 775a10ba1105 |
13 | 32122c034888 |
14 | 15825188d8b3 |
15 | 9c53a3bc0bb |
hex | 526e585b555 |
5664617641301 has 2 divisors, whose sum is σ = 5664617641302. Its totient is φ = 5664617641300.
The previous prime is 5664617641201. The next prime is 5664617641303. The reversal of 5664617641301 is 1031467164665.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4222634559025 + 1441983082276 = 2054905^2 + 1200826^2 .
It is a cyclic number.
It is not a de Polignac number, because 5664617641301 - 214 = 5664617624917 is a prime.
Together with 5664617641303, 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 5664617641301.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5664617641303) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2832308820650 + 2832308820651.
It is an arithmetic number, because the mean of its divisors is an integer number (2832308820651).
Almost surely, 25664617641301 is an apocalyptic number.
It is an amenable number.
5664617641301 is a deficient number, since it is larger than the sum of its proper divisors (1).
5664617641301 is an equidigital number, since it uses as much as digits as its factorization.
5664617641301 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2177280, while the sum is 50.
The spelling of 5664617641301 in words is "five trillion, six hundred sixty-four billion, six hundred seventeen million, six hundred forty-one thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •