Base | Representation |
---|---|
bin | 1101000000101… |
… | …1001111100000 |
3 | 10210200112201012 |
4 | 3100023033200 |
5 | 102432301000 |
6 | 5225400052 |
7 | 1231566020 |
oct | 320131740 |
9 | 123615635 |
10 | 54572000 |
11 | 2889382a |
12 | 16339028 |
13 | b3c9432 |
14 | 7367a80 |
15 | 4bce735 |
hex | 340b3e0 |
54572000 has 96 divisors (see below), whose sum is σ = 153316800. Its totient is φ = 18700800.
The previous prime is 54571987. The next prime is 54572039. The reversal of 54572000 is 27545.
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 15 ways as a sum of consecutive naturals, for example, 27026 + ... + 28974.
It is an arithmetic number, because the mean of its divisors is an integer number (1597050).
Almost surely, 254572000 is an apocalyptic number.
54572000 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 54572000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (76658400).
54572000 is an abundant number, since it is smaller than the sum of its proper divisors (98744800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
54572000 is a wasteful number, since it uses less digits than its factorization.
54572000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1981 (or 1963 counting only the distinct ones).
The product of its (nonzero) digits is 1400, while the sum is 23.
The square root of 54572000 is about 7387.2863759299. The cubic root of 54572000 is about 379.3062133111.
Adding to 54572000 its reverse (27545), we get a palindrome (54599545).
The spelling of 54572000 in words is "fifty-four million, five hundred seventy-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •