Base | Representation |
---|---|
bin | 11000110110110010001110… |
… | …01000101000110101100000 |
3 | 21011112100022000100212112220 |
4 | 30123121013020220311200 |
5 | 24131013010444140043 |
6 | 312125550153551040 |
7 | 14340656444611401 |
oct | 1433310710506540 |
9 | 234470260325486 |
10 | 54658947255648 |
11 | 1646380285195a |
12 | 616932aa15480 |
13 | 246641678c628 |
14 | d6d7159239a8 |
15 | 64bc10a8b483 |
hex | 31b647228d60 |
54658947255648 has 192 divisors, whose sum is σ = 147160975675392. Its totient is φ = 17756838328320.
The previous prime is 54658947255643. The next prime is 54658947255727. The reversal of 54658947255648 is 84655274985645.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (54658947255643) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3507593265 + ... + 3507608847.
It is an arithmetic number, because the mean of its divisors is an integer number (766463414976).
Almost surely, 254658947255648 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 54658947255648, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (73580487837696).
54658947255648 is an abundant number, since it is smaller than the sum of its proper divisors (92502028419744).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
54658947255648 is a wasteful number, since it uses less digits than its factorization.
54658947255648 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20197 (or 20189 counting only the distinct ones).
The product of its digits is 11612160000, while the sum is 78.
The spelling of 54658947255648 in words is "fifty-four trillion, six hundred fifty-eight billion, nine hundred forty-seven million, two hundred fifty-five thousand, six hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.343 sec. • engine limits •