Base | Representation |
---|---|
bin | 100110101010… |
… | …110110101000 |
3 | 201002000100110 |
4 | 212222312220 |
5 | 10043341000 |
6 | 1001134320 |
7 | 152106636 |
oct | 46526650 |
9 | 21060313 |
10 | 10137000 |
11 | 57a4095 |
12 | 348a3a0 |
13 | 213c033 |
14 | 14bc356 |
15 | d53850 |
hex | 9aada8 |
10137000 has 128 divisors (see below), whose sum is σ = 32947200. Its totient is φ = 2592000.
The previous prime is 10136993. The next prime is 10137047. The reversal of 10137000 is 73101.
10137000 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 (12).
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 92946 + ... + 93054.
It is an arithmetic number, because the mean of its divisors is an integer number (257400).
Almost surely, 210137000 is an apocalyptic number.
10137000 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 10137000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16473600).
10137000 is an abundant number, since it is smaller than the sum of its proper divisors (22810200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10137000 is a wasteful number, since it uses less digits than its factorization.
10137000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 164 (or 150 counting only the distinct ones).
The product of its (nonzero) digits is 21, while the sum is 12.
The square root of 10137000 is about 3183.8655750518. The cubic root of 10137000 is about 216.4228684449.
The spelling of 10137000 in words is "ten million, one hundred thirty-seven thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •