Base | Representation |
---|---|
bin | 1010010111010100… |
… | …00000010000000000 |
3 | 112100210011011220002 |
4 | 11023222000100000 |
5 | 42343423111233 |
6 | 2320045335132 |
7 | 254613340154 |
oct | 51352002000 |
9 | 15323134802 |
10 | 5564269568 |
11 | 23a59810a0 |
12 | 10b35674a8 |
13 | 6a8a27100 |
14 | 3aadc7064 |
15 | 2287676e8 |
hex | 14ba80400 |
5564269568 has 264 divisors, whose sum is σ = 13665444480. Its totient is φ = 2242805760.
The previous prime is 5564269561. The next prime is 5564269589. The reversal of 5564269568 is 8659624655.
It is a super-2 number, since 2×55642695682 = 61922191650741813248, which contains 22 as substring.
It is a Smith number, since the sum of its digits (56) coincides with the sum of the digits of its prime factors.
It is not an unprimeable number, because it can be changed into a prime (5564269561) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 70433753 + ... + 70433831.
Almost surely, 25564269568 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 5564269568, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6832722240).
5564269568 is an abundant number, since it is smaller than the sum of its proper divisors (8101174912).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5564269568 is a wasteful number, since it uses less digits than its factorization.
5564269568 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 173 (or 142 counting only the distinct ones).
The product of its digits is 15552000, while the sum is 56.
The square root of 5564269568 is about 74594.0317183620. The cubic root of 5564269568 is about 1772.0231335738.
The spelling of 5564269568 in words is "five billion, five hundred sixty-four million, two hundred sixty-nine thousand, five hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •