Base | Representation |
---|---|
bin | 1101000000101… |
… | …0010111010100 |
3 | 10210200100210000 |
4 | 3100022113110 |
5 | 102432142104 |
6 | 5225331300 |
7 | 1231552362 |
oct | 320122724 |
9 | 123610700 |
10 | 54568404 |
11 | 28891060 |
12 | 16336b30 |
13 | b3c78c7 |
14 | 7366632 |
15 | 4bcd639 |
hex | 340a5d4 |
54568404 has 120 divisors (see below), whose sum is σ = 158802336. Its totient is φ = 16200000.
The previous prime is 54568391. The next prime is 54568427. The reversal of 54568404 is 40486545.
54568404 is a `hidden beast` number, since 54 + 568 + 40 + 4 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 217279 + ... + 217529.
Almost surely, 254568404 is an apocalyptic number.
54568404 is a gapful number since it is divisible by the number (54) 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 54568404, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (79401168).
54568404 is an abundant number, since it is smaller than the sum of its proper divisors (104233932).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
54568404 is a wasteful number, since it uses less digits than its factorization.
54568404 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 339 (or 328 counting only the distinct ones).
The product of its (nonzero) digits is 76800, while the sum is 36.
The square root of 54568404 is about 7387.0429807874. The cubic root of 54568404 is about 379.2978817180.
The spelling of 54568404 in words is "fifty-four million, five hundred sixty-eight thousand, four hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •