Base | Representation |
---|---|
bin | 101000111010… |
… | …100001111100 |
3 | 202011220121202 |
4 | 220322201330 |
5 | 10221204000 |
6 | 1021515032 |
7 | 160110452 |
oct | 50724174 |
9 | 22156552 |
10 | 10725500 |
11 | 6066255 |
12 | 3712a78 |
13 | 22b6b66 |
14 | 15d29d2 |
15 | e1cdd5 |
hex | a3a87c |
10725500 has 48 divisors (see below), whose sum is σ = 24679200. Its totient is φ = 4060800.
The previous prime is 10725499. The next prime is 10725511. The reversal of 10725500 is 552701.
10725500 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 8936 + ... + 10064.
It is an arithmetic number, because the mean of its divisors is an integer number (514150).
Almost surely, 210725500 is an apocalyptic number.
10725500 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 10725500, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (12339600).
10725500 is an abundant number, since it is smaller than the sum of its proper divisors (13953700).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10725500 is a wasteful number, since it uses less digits than its factorization.
10725500 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1167 (or 1155 counting only the distinct ones).
The product of its (nonzero) digits is 350, while the sum is 20.
The square root of 10725500 is about 3274.9809159749. The cubic root of 10725500 is about 220.5324568337.
The spelling of 10725500 in words is "ten million, seven hundred twenty-five thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •