Base | Representation |
---|---|
bin | 100110100111… |
… | …010100000100 |
3 | 201001021110102 |
4 | 212213110010 |
5 | 10042410000 |
6 | 1000543232 |
7 | 152016443 |
oct | 46472404 |
9 | 21037412 |
10 | 10122500 |
11 | 5794203 |
12 | 3481b18 |
13 | 213555b |
14 | 14b6d5a |
15 | d4e3d5 |
hex | 9a7504 |
10122500 has 30 divisors (see below), whose sum is σ = 22141350. Its totient is φ = 4048000.
The previous prime is 10122499. The next prime is 10122527. The reversal of 10122500 is 522101.
It can be written as a sum of positive squares in 5 ways, for example, as 5317636 + 4804864 = 2306^2 + 2192^2 .
It is an unprimeable number.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 476 + ... + 4524.
It is an arithmetic number, because the mean of its divisors is an integer number (738045).
Almost surely, 210122500 is an apocalyptic number.
10122500 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 10122500, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (11070675).
10122500 is an abundant number, since it is smaller than the sum of its proper divisors (12018850).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10122500 is an equidigital number, since it uses as much as digits as its factorization.
10122500 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4073 (or 4056 counting only the distinct ones).
The product of its (nonzero) digits is 20, while the sum is 11.
The square root of 10122500 is about 3181.5876539866. The cubic root of 10122500 is about 216.3196285302.
Adding to 10122500 its reverse (522101), we get a palindrome (10644601).
The spelling of 10122500 in words is "ten million, one hundred twenty-two thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •