Base | Representation |
---|---|
bin | 101000101110… |
… | …001110110101 |
3 | 202002100112000 |
4 | 220232032311 |
5 | 10213101000 |
6 | 1020445513 |
7 | 156510546 |
oct | 50561665 |
9 | 22070460 |
10 | 10675125 |
11 | 603141a |
12 | 36a9899 |
13 | 2299c56 |
14 | 15bc4cd |
15 | e0d000 |
hex | a2e3b5 |
10675125 has 32 divisors (see below), whose sum is σ = 19743360. Its totient is φ = 5691600.
The previous prime is 10675121. The next prime is 10675127. The reversal of 10675125 is 52157601.
It is not a de Polignac number, because 10675125 - 22 = 10675121 is a prime.
It is a super-2 number, since 2×106751252 = 227916587531250, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10675121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1794 + ... + 4956.
It is an arithmetic number, because the mean of its divisors is an integer number (616980).
Almost surely, 210675125 is an apocalyptic number.
10675125 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
10675125 is a deficient number, since it is larger than the sum of its proper divisors (9068235).
10675125 is an equidigital number, since it uses as much as digits as its factorization.
10675125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3187 (or 3171 counting only the distinct ones).
The product of its (nonzero) digits is 2100, while the sum is 27.
The square root of 10675125 is about 3267.2809796527. The cubic root of 10675125 is about 220.1866528895.
The spelling of 10675125 in words is "ten million, six hundred seventy-five thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •