Base | Representation |
---|---|
bin | 100101111111101100011… |
… | …0100111010100011001001 |
3 | 200111012221202120212111001 |
4 | 1023333120310322203021 |
5 | 1141024200342431401 |
6 | 15034544140135001 |
7 | 1046164412150611 |
oct | 113773064724311 |
9 | 20435852525431 |
10 | 5222023014601 |
11 | 1733713943578 |
12 | 704090b37461 |
13 | 2bb585c32a13 |
14 | 140a666b9a41 |
15 | 90c8431d601 |
hex | 4bfd8d3a8c9 |
5222023014601 has 2 divisors, whose sum is σ = 5222023014602. Its totient is φ = 5222023014600.
The previous prime is 5222023014599. The next prime is 5222023014619. The reversal of 5222023014601 is 1064103202225.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4879504281600 + 342518733001 = 2208960^2 + 585251^2 .
It is a cyclic number.
It is not a de Polignac number, because 5222023014601 - 21 = 5222023014599 is a prime.
Together with 5222023014599, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 5222023014601.
It is not a weakly prime, because it can be changed into another prime (5222023018601) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2611011507300 + 2611011507301.
It is an arithmetic number, because the mean of its divisors is an integer number (2611011507301).
Almost surely, 25222023014601 is an apocalyptic number.
It is an amenable number.
5222023014601 is a deficient number, since it is larger than the sum of its proper divisors (1).
5222023014601 is an equidigital number, since it uses as much as digits as its factorization.
5222023014601 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 5760, while the sum is 28.
Adding to 5222023014601 its reverse (1064103202225), we get a palindrome (6286126216826).
The spelling of 5222023014601 in words is "five trillion, two hundred twenty-two billion, twenty-three million, fourteen thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •