Base | Representation |
---|---|
bin | 1010100001010110… |
… | …10110101011010000 |
3 | 112120122200000120001 |
4 | 11100223112223100 |
5 | 43032004302043 |
6 | 2332255055344 |
7 | 256655353105 |
oct | 52053265320 |
9 | 15518600501 |
10 | 5648509648 |
11 | 24394889a1 |
12 | 1117811554 |
13 | 6c0310402 |
14 | 3b8274aac |
15 | 230d5774d |
hex | 150ad6ad0 |
5648509648 has 90 divisors (see below), whose sum is σ = 11755880822. Its totient is φ = 2628933120.
The previous prime is 5648509631. The next prime is 5648509687. The reversal of 5648509648 is 8469058465.
It can be written as a sum of positive squares in 3 ways, for example, as 40297104 + 5608212544 = 6348^2 + 74888^2 .
It is a super-2 number, since 2×56485096482 = 63811322487098167808, which contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 14227786 + ... + 14228182.
Almost surely, 25648509648 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 5648509648, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5877940411).
5648509648 is an abundant number, since it is smaller than the sum of its proper divisors (6107371174).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5648509648 is a wasteful number, since it uses less digits than its factorization.
5648509648 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 533 (or 463 counting only the distinct ones).
The product of its (nonzero) digits is 8294400, while the sum is 55.
The square root of 5648509648 is about 75156.5675639860. The cubic root of 5648509648 is about 1780.9208768698.
The spelling of 5648509648 in words is "five billion, six hundred forty-eight million, five hundred nine thousand, six hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •