Base | Representation |
---|---|
bin | 100110010111… |
… | …001011010000 |
3 | 200220220210021 |
4 | 212113023100 |
5 | 10033301100 |
6 | 555313224 |
7 | 151322644 |
oct | 46271320 |
9 | 20826707 |
10 | 10056400 |
11 | 5749582 |
12 | 344b814 |
13 | 2111443 |
14 | 149ac24 |
15 | d39a1a |
hex | 9972d0 |
10056400 has 60 divisors (see below), whose sum is σ = 24970624. Its totient is φ = 3888000.
The previous prime is 10056391. The next prime is 10056421. The reversal of 10056400 is 465001.
It is a super-2 number, since 2×100564002 = 202262361920000, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (16).
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 11 ways as a sum of consecutive naturals, for example, 11995 + ... + 12805.
Almost surely, 210056400 is an apocalyptic number.
10056400 is a gapful number since it is divisible by the number (10) 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 10056400, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (12485312).
10056400 is an abundant number, since it is smaller than the sum of its proper divisors (14914224).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10056400 is a wasteful number, since it uses less digits than its factorization.
10056400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 860 (or 849 counting only the distinct ones).
The product of its (nonzero) digits is 120, while the sum is 16.
The square root of 10056400 is about 3171.1827446554. The cubic root of 10056400 is about 215.8477436385.
The spelling of 10056400 in words is "ten million, fifty-six thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •