Base | Representation |
---|---|
bin | 1010100001011000… |
… | …10010110100000000 |
3 | 112120200010112110000 |
4 | 11100230102310000 |
5 | 43032040142333 |
6 | 2332304240000 |
7 | 256660430202 |
oct | 52054226400 |
9 | 15520115400 |
10 | 5648755968 |
11 | 2439636a69 |
12 | 1117910000 |
13 | 6c039856b |
14 | 3b82da772 |
15 | 230da5713 |
hex | 150b12d00 |
5648755968 has 180 divisors, whose sum is σ = 16914983008. Its totient is φ = 1874949120.
The previous prime is 5648755967. The next prime is 5648755979. The reversal of 5648755968 is 8695578465.
5648755968 is a `hidden beast` number, since 564 + 8 + 7 + 5 + 5 + 9 + 68 = 666.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5648755967) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 6863205 + ... + 6864027.
Almost surely, 25648755968 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 5648755968, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (8457491504).
5648755968 is an abundant number, since it is smaller than the sum of its proper divisors (11266227040).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5648755968 is an equidigital number, since it uses as much as digits as its factorization.
5648755968 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1182 (or 1159 counting only the distinct ones).
The product of its digits is 72576000, while the sum is 63.
The square root of 5648755968 is about 75158.2062585317. The cubic root of 5648755968 is about 1780.9467639375.
The spelling of 5648755968 in words is "five billion, six hundred forty-eight million, seven hundred fifty-five thousand, nine hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •