Base | Representation |
---|---|
bin | 100110011101… |
… | …100101000001 |
3 | 200222020202120 |
4 | 212131211001 |
5 | 10040121000 |
6 | 1000034453 |
7 | 151462260 |
oct | 46354501 |
9 | 20866676 |
10 | 10082625 |
11 | 5767253 |
12 | 3462a29 |
13 | 2120367 |
14 | 14a65d7 |
15 | d426a0 |
hex | 99d941 |
10082625 has 64 divisors (see below), whose sum is σ = 20127744. Its totient is φ = 4382400.
The previous prime is 10082623. The next prime is 10082627. The reversal of 10082625 is 52628001.
It is an interprime number because it is at equal distance from previous prime (10082623) and next prime (10082627).
It is not a de Polignac number, because 10082625 - 21 = 10082623 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10082595 and 10082604.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10082621) by changing a digit.
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 63 ways as a sum of consecutive naturals, for example, 60292 + ... + 60458.
It is an arithmetic number, because the mean of its divisors is an integer number (314496).
Almost surely, 210082625 is an apocalyptic number.
10082625 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
10082625 is a deficient number, since it is larger than the sum of its proper divisors (10045119).
10082625 is a wasteful number, since it uses less digits than its factorization.
10082625 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 215 (or 205 counting only the distinct ones).
The product of its (nonzero) digits is 960, while the sum is 24.
The square root of 10082625 is about 3175.3149450094. The cubic root of 10082625 is about 216.0352094524.
The spelling of 10082625 in words is "ten million, eighty-two thousand, six hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •