Base | Representation |
---|---|
bin | 1101100100010… |
… | …1111111101000 |
3 | 10222002022120101 |
4 | 3121011333220 |
5 | 104032103200 |
6 | 5351435144 |
7 | 1260503533 |
oct | 331057750 |
9 | 128068511 |
10 | 56909800 |
11 | 2a1401a2 |
12 | 17085ab4 |
13 | ba3754c |
14 | 77b5a1a |
15 | 4ee226a |
hex | 3645fe8 |
56909800 has 96 divisors (see below), whose sum is σ = 139633920. Its totient is φ = 21542400.
The previous prime is 56909791. The next prime is 56909813. The reversal of 56909800 is 890965.
It is a super-3 number, since 3×569098003 (a number of 24 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 56909800.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 415332 + ... + 415468.
It is an arithmetic number, because the mean of its divisors is an integer number (1454520).
Almost surely, 256909800 is an apocalyptic number.
56909800 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 56909800, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (69816960).
56909800 is an abundant number, since it is smaller than the sum of its proper divisors (82724120).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56909800 is a wasteful number, since it uses less digits than its factorization.
56909800 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 251 (or 242 counting only the distinct ones).
The product of its (nonzero) digits is 19440, while the sum is 37.
The square root of 56909800 is about 7543.8584292125. The cubic root of 56909800 is about 384.6470031442.
The spelling of 56909800 in words is "fifty-six million, nine hundred nine thousand, eight hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •