Base | Representation |
---|---|
bin | 101000000100… |
… | …101100101000 |
3 | 201202201011002 |
4 | 220010230220 |
5 | 10142130000 |
6 | 1013054132 |
7 | 155201552 |
oct | 50045450 |
9 | 21681132 |
10 | 10505000 |
11 | 5a25620 |
12 | 3627348 |
13 | 223a69c |
14 | 15764d2 |
15 | dc78d5 |
hex | a04b28 |
10505000 has 80 divisors (see below), whose sum is σ = 26991360. Its totient is φ = 3800000.
The previous prime is 10504999. The next prime is 10505039. The reversal of 10505000 is 50501.
It is a super-2 number, since 2×105050002 = 220710050000000, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (11).
It is an unprimeable number.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 54905 + ... + 55095.
It is an arithmetic number, because the mean of its divisors is an integer number (337392).
Almost surely, 210505000 is an apocalyptic number.
10505000 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 10505000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13495680).
10505000 is an abundant number, since it is smaller than the sum of its proper divisors (16486360).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10505000 is a wasteful number, since it uses less digits than its factorization.
10505000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 228 (or 209 counting only the distinct ones).
The product of its (nonzero) digits is 25, while the sum is 11.
The square root of 10505000 is about 3241.1417741284. The cubic root of 10505000 is about 219.0107095671.
Adding to 10505000 its reverse (50501), we get a palindrome (10555501).
The spelling of 10505000 in words is "ten million, five hundred five thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •