Base | Representation |
---|---|
bin | 100110010111… |
… | …001100110100 |
3 | 200220220220222 |
4 | 212113030310 |
5 | 10033302000 |
6 | 555313512 |
7 | 151323146 |
oct | 46271464 |
9 | 20826828 |
10 | 10056500 |
11 | 5749663 |
12 | 344b898 |
13 | 21114bc |
14 | 149ac96 |
15 | d39a85 |
hex | 997334 |
10056500 has 24 divisors (see below), whose sum is σ = 21964488. Its totient is φ = 4022400.
The previous prime is 10056443. The next prime is 10056509. The reversal of 10056500 is 565001.
10056500 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 2149156 + 7907344 = 1466^2 + 2812^2 .
It is a super-2 number, since 2×100565002 = 202266384500000, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10056509) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9557 + ... + 10556.
It is an arithmetic number, because the mean of its divisors is an integer number (915187).
Almost surely, 210056500 is an apocalyptic number.
10056500 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10056500 is an abundant number, since it is smaller than the sum of its proper divisors (11907988).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10056500 is a wasteful number, since it uses less digits than its factorization.
10056500 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20132 (or 20120 counting only the distinct ones).
The product of its (nonzero) digits is 150, while the sum is 17.
The square root of 10056500 is about 3171.1985116041. The cubic root of 10056500 is about 215.8484590934.
The spelling of 10056500 in words is "ten million, fifty-six thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •