Base | Representation |
---|---|
bin | 1101011111110… |
… | …0100000100000 |
3 | 10221112000200020 |
4 | 3113330200200 |
5 | 103442440200 |
6 | 5341153440 |
7 | 1255111143 |
oct | 327744040 |
9 | 127460606 |
10 | 56608800 |
11 | 29a55036 |
12 | 16b5b880 |
13 | b960541 |
14 | 773805a |
15 | 4e82ea0 |
hex | 35fc820 |
56608800 has 144 divisors (see below), whose sum is σ = 186863040. Its totient is φ = 14883840.
The previous prime is 56608787. The next prime is 56608807. The reversal of 56608800 is 880665.
It is not an unprimeable number, because it can be changed into a prime (56608807) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 247086 + ... + 247314.
It is an arithmetic number, because the mean of its divisors is an integer number (1297660).
Almost surely, 256608800 is an apocalyptic number.
56608800 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 56608800, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (93431520).
56608800 is an abundant number, since it is smaller than the sum of its proper divisors (130254240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56608800 is a wasteful number, since it uses less digits than its factorization.
56608800 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 355 (or 342 counting only the distinct ones).
The product of its (nonzero) digits is 11520, while the sum is 33.
The square root of 56608800 is about 7523.8819767458. The cubic root of 56608800 is about 383.9676622074.
It can be divided in two parts, 56 and 608800, that added together give a triangular number (608856 = T1103).
The spelling of 56608800 in words is "fifty-six million, six hundred eight thousand, eight hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.112 sec. • engine limits •