Base | Representation |
---|---|
bin | 100110101011… |
… | …000010010110 |
3 | 201002001101020 |
4 | 212223002112 |
5 | 10043402000 |
6 | 1001142010 |
7 | 152112060 |
oct | 46530226 |
9 | 21061336 |
10 | 10137750 |
11 | 57a4707 |
12 | 348a906 |
13 | 213c48c |
14 | 14bc730 |
15 | d53ba0 |
hex | 9ab096 |
10137750 has 64 divisors (see below), whose sum is σ = 28933632. Its totient is φ = 2316000.
The previous prime is 10137739. The next prime is 10137781. The reversal of 10137750 is 5773101.
It is a self number, because there is not a number n which added to its sum of digits gives 10137750.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 4285 + ... + 6215.
It is an arithmetic number, because the mean of its divisors is an integer number (452088).
Almost surely, 210137750 is an apocalyptic number.
10137750 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 10137750, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14466816).
10137750 is an abundant number, since it is smaller than the sum of its proper divisors (18795882).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10137750 is a wasteful number, since it uses less digits than its factorization.
10137750 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1958 (or 1948 counting only the distinct ones).
The product of its (nonzero) digits is 735, while the sum is 24.
The square root of 10137750 is about 3183.9833542278. The cubic root of 10137750 is about 216.4282057620.
The spelling of 10137750 in words is "ten million, one hundred thirty-seven thousand, seven hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •