Base | Representation |
---|---|
bin | 101000101101… |
… | …100101110100 |
3 | 202002012220210 |
4 | 220231211310 |
5 | 10213010000 |
6 | 1020425420 |
7 | 156500106 |
oct | 50554564 |
9 | 22065823 |
10 | 10672500 |
11 | 602a453 |
12 | 36a8270 |
13 | 22989b7 |
14 | 15bb576 |
15 | e0c350 |
hex | a2d974 |
10672500 has 60 divisors (see below), whose sum is σ = 31140032. Its totient is φ = 2844000.
The previous prime is 10672489. The next prime is 10672523. The reversal of 10672500 is 527601.
10672500 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (60).
It is a super-2 number, since 2×106725002 = 227804512500000, which contains 22 as substring.
It is a congruent number.
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, 6789 + ... + 8211.
Almost surely, 210672500 is an apocalyptic number.
10672500 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 10672500, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15570016).
10672500 is an abundant number, since it is smaller than the sum of its proper divisors (20467532).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10672500 is a wasteful number, since it uses less digits than its factorization.
10672500 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1450 (or 1433 counting only the distinct ones).
The product of its (nonzero) digits is 420, while the sum is 21.
The square root of 10672500 is about 3266.8792447839. The cubic root of 10672500 is about 220.1686035350.
The spelling of 10672500 in words is "ten million, six hundred seventy-two thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •