Base | Representation |
---|---|
bin | 1010100011011001… |
… | …00011010010010000 |
3 | 112121211211100000100 |
4 | 11101230203102100 |
5 | 43100343210111 |
6 | 2334105252400 |
7 | 260253545112 |
oct | 52154432220 |
9 | 15554740010 |
10 | 5665600656 |
11 | 24480a16a1 |
12 | 1121494100 |
13 | 6c3a15731 |
14 | 3ba6433b2 |
15 | 2325d1756 |
hex | 151b23490 |
5665600656 has 120 divisors (see below), whose sum is σ = 16218783360. Its totient is φ = 1845792000.
The previous prime is 5665600651. The next prime is 5665600657. The reversal of 5665600656 is 6560065665.
It is not an unprimeable number, because it can be changed into a prime (5665600651) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1146511 + ... + 1151441.
It is an arithmetic number, because the mean of its divisors is an integer number (135156528).
Almost surely, 25665600656 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 5665600656, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (8109391680).
5665600656 is an abundant number, since it is smaller than the sum of its proper divisors (10553182704).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5665600656 is a wasteful number, since it uses less digits than its factorization.
5665600656 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5125 (or 5116 counting only the distinct ones).
The product of its (nonzero) digits is 972000, while the sum is 45.
The square root of 5665600656 is about 75270.1843760197. The cubic root of 5665600656 is about 1782.7152785383.
The spelling of 5665600656 in words is "five billion, six hundred sixty-five million, six hundred thousand, six hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •