Base | Representation |
---|---|
bin | 110010110100100100… |
… | …000100000000000000 |
3 | 12012212000010101110121 |
4 | 302310210010000000 |
5 | 1343224123210000 |
6 | 41022454110024 |
7 | 3641161335562 |
oct | 626444040000 |
9 | 165760111417 |
10 | 54568960000 |
11 | 21162834355 |
12 | a6ab04b314 |
13 | 51b850c859 |
14 | 28d946b332 |
15 | 1645a55b1a |
hex | cb4904000 |
54568960000 has 225 divisors, whose sum is σ = 138268318881. Its totient is φ = 21528576000.
The previous prime is 54568959997. The next prime is 54568960001. The reversal of 54568960000 is 6986545.
The square root of 54568960000 is 233600.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 7 ways, for example, as 38705053696 + 15863906304 = 196736^2 + 125952^2 .
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (54568960001) by changing a digit.
It is a polite number, since it can be written in 14 ways as a sum of consecutive naturals, for example, 747519964 + ... + 747520036.
Almost surely, 254568960000 is an apocalyptic number.
54568960000 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
54568960000 is the 233600-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 54568960000
54568960000 is an abundant number, since it is smaller than the sum of its proper divisors (83699358881).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
54568960000 is an frugal number, since it uses more digits than its factorization.
54568960000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 194 (or 80 counting only the distinct ones).
The product of its (nonzero) digits is 259200, while the sum is 43.
The spelling of 54568960000 in words is "fifty-four billion, five hundred sixty-eight million, nine hundred sixty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •