Base | Representation |
---|---|
bin | 110010110100001111… |
… | …110000010110000000 |
3 | 12012211122002221010221 |
4 | 302310033300112000 |
5 | 1343221242332413 |
6 | 41022144032424 |
7 | 3641065154515 |
oct | 626417602600 |
9 | 165748087127 |
10 | 54563636608 |
11 | 2115a828858 |
12 | a6a9302714 |
13 | 51b7397810 |
14 | 28d888330c |
15 | 164535368d |
hex | cb43f0580 |
54563636608 has 64 divisors (see below), whose sum is σ = 117118048320. Its totient is φ = 25171292160.
The previous prime is 54563636563. The next prime is 54563636609. The reversal of 54563636608 is 80663636545.
It is a tau number, because it is divible by the number of its divisors (64).
It is a Harshad number since it is a multiple of its sum of digits (52).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (54563636609) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4188441 + ... + 4201447.
It is an arithmetic number, because the mean of its divisors is an integer number (1829969505).
Almost surely, 254563636608 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 54563636608, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (58559024160).
54563636608 is an abundant number, since it is smaller than the sum of its proper divisors (62554411712).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
54563636608 is a wasteful number, since it uses less digits than its factorization.
54563636608 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15555 (or 15543 counting only the distinct ones).
The product of its (nonzero) digits is 9331200, while the sum is 52.
The spelling of 54563636608 in words is "fifty-four billion, five hundred sixty-three million, six hundred thirty-six thousand, six hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •