Base | Representation |
---|---|
bin | 1010100011010011… |
… | …11001010101101111 |
3 | 112121210111222010222 |
4 | 11101221321111233 |
5 | 43100203421214 |
6 | 2334042321555 |
7 | 260244615506 |
oct | 52151712557 |
9 | 15553458128 |
10 | 5664904559 |
11 | 2447766706 |
12 | 11211b92bb |
13 | 6c3830942 |
14 | 3ba50183d |
15 | 2324e538e |
hex | 151a7956f |
5664904559 has 2 divisors, whose sum is σ = 5664904560. Its totient is φ = 5664904558.
The previous prime is 5664904481. The next prime is 5664904561. The reversal of 5664904559 is 9554094665.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 5664904559 - 216 = 5664839023 is a prime.
It is a super-2 number, since 2×56649045592 = 64182287325157968962, which contains 22 as substring.
Together with 5664904561, 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 5664904559.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5664904759) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2832452279 + 2832452280.
It is an arithmetic number, because the mean of its divisors is an integer number (2832452280).
Almost surely, 25664904559 is an apocalyptic number.
5664904559 is a deficient number, since it is larger than the sum of its proper divisors (1).
5664904559 is an equidigital number, since it uses as much as digits as its factorization.
5664904559 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5832000, while the sum is 53.
The square root of 5664904559 is about 75265.5602450417. The cubic root of 5664904559 is about 1782.6422651806.
The spelling of 5664904559 in words is "five billion, six hundred sixty-four million, nine hundred four thousand, five hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •