Base | Representation |
---|---|
bin | 110010111010101101… |
… | …001000010000000000 |
3 | 12020010012000100202220 |
4 | 302322231020100000 |
5 | 1343432013000000 |
6 | 41041014411040 |
7 | 3643552222002 |
oct | 627255102000 |
9 | 166105010686 |
10 | 54672000000 |
11 | 21205a11882 |
12 | a719660a80 |
13 | 5203978c77 |
14 | 2909010372 |
15 | 164eb0b1a0 |
hex | cbab48400 |
54672000000 has 616 divisors, whose sum is σ = 195741869472. Its totient is φ = 13516800000.
The previous prime is 54671999989. The next prime is 54672000013. The reversal of 54672000000 is 27645.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 55 ways as a sum of consecutive naturals, for example, 815999967 + ... + 816000033.
Almost surely, 254672000000 is an apocalyptic number.
54672000000 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 54672000000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (97870934736).
54672000000 is an abundant number, since it is smaller than the sum of its proper divisors (141069869472).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
54672000000 is an frugal number, since it uses more digits than its factorization.
54672000000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 137 (or 94 counting only the distinct ones).
The product of its (nonzero) digits is 1680, while the sum is 24.
Adding to 54672000000 its reverse (27645), we get a palindrome (54672027645).
The spelling of 54672000000 in words is "fifty-four billion, six hundred seventy-two million", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •