Base | Representation |
---|---|
bin | 1101100011101… |
… | …1110010100000 |
3 | 10222000012020020 |
4 | 3120323302200 |
5 | 104024234000 |
6 | 5350513440 |
7 | 1260240630 |
oct | 330736240 |
9 | 128005206 |
10 | 56868000 |
11 | 2a111852 |
12 | 17065880 |
13 | ba21507 |
14 | 77a46c0 |
15 | 4ed4ba0 |
hex | 363bca0 |
56868000 has 192 divisors, whose sum is σ = 213228288. Its totient is φ = 12979200.
The previous prime is 56867999. The next prime is 56868013. The reversal of 56868000 is 86865.
56868000 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 83662 + ... + 84338.
It is an arithmetic number, because the mean of its divisors is an integer number (1110564).
Almost surely, 256868000 is an apocalyptic number.
56868000 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 56868000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (106614144).
56868000 is an abundant number, since it is smaller than the sum of its proper divisors (156360288).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56868000 is a wasteful number, since it uses less digits than its factorization.
56868000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 712 (or 694 counting only the distinct ones).
The product of its (nonzero) digits is 11520, while the sum is 33.
The square root of 56868000 is about 7541.0874547375. The cubic root of 56868000 is about 384.5528062291.
The spelling of 56868000 in words is "fifty-six million, eight hundred sixty-eight thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •