Base | Representation |
---|---|
bin | 1101100100101… |
… | …1110011100000 |
3 | 10222010112012212 |
4 | 3121023303200 |
5 | 104033333400 |
6 | 5352141252 |
7 | 1260633113 |
oct | 331136340 |
9 | 128115185 |
10 | 56933600 |
11 | 2a157069 |
12 | 17097828 |
13 | ba45329 |
14 | 77c057a |
15 | 4ee9335 |
hex | 364bce0 |
56933600 has 36 divisors (see below), whose sum is σ = 138991104. Its totient is φ = 22773120.
The previous prime is 56933593. The next prime is 56933603. The reversal of 56933600 is 633965.
56933600 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (32).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (56933603) by changing a digit.
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 5 ways as a sum of consecutive naturals, for example, 34784 + ... + 36383.
It is an arithmetic number, because the mean of its divisors is an integer number (3860864).
Almost surely, 256933600 is an apocalyptic number.
56933600 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
56933600 is an abundant number, since it is smaller than the sum of its proper divisors (82057504).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56933600 is a wasteful number, since it uses less digits than its factorization.
56933600 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 71187 (or 71174 counting only the distinct ones).
The product of its (nonzero) digits is 14580, while the sum is 32.
The square root of 56933600 is about 7545.4357064387. The cubic root of 56933600 is about 384.7006161880.
The spelling of 56933600 in words is "fifty-six million, nine hundred thirty-three thousand, six hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •