Base | Representation |
---|---|
bin | 11000101111001101000000… |
… | …00000000000000000000000 |
3 | 21010121102220011201012100220 |
4 | 30113212200000000000000 |
5 | 24112231003430032100 |
6 | 311410144541543040 |
7 | 14313105116406330 |
oct | 1427464000000000 |
9 | 233542804635326 |
10 | 54398445158400 |
11 | 163732841445a2 |
12 | 6126949274a80 |
13 | 244799c9a5715 |
14 | d60c8240d0c0 |
15 | 645065c84aa0 |
hex | 3179a0000000 |
54398445158400 has 720 divisors, whose sum is σ = 206639466352704. Its totient is φ = 12369505812480.
The previous prime is 54398445158383. The next prime is 54398445158419. The reversal of 54398445158400 is 485154489345.
It is a Harshad number since it is a multiple of its sum of digits (60).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 281857228704 + ... + 281857228896.
Almost surely, 254398445158400 is an apocalyptic number.
54398445158400 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 54398445158400, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (103319733176352).
54398445158400 is an abundant number, since it is smaller than the sum of its proper divisors (152241021194304).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
54398445158400 is an frugal number, since it uses more digits than its factorization.
54398445158400 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 271 (or 210 counting only the distinct ones).
The product of its (nonzero) digits is 55296000, while the sum is 60.
The spelling of 54398445158400 in words is "fifty-four trillion, three hundred ninety-eight billion, four hundred forty-five million, one hundred fifty-eight thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •