Base | Representation |
---|---|
bin | 100111011001… |
… | …010110111101 |
3 | 201102200122110 |
4 | 213121112331 |
5 | 10120434420 |
6 | 1005204233 |
7 | 153532200 |
oct | 47312675 |
9 | 21380573 |
10 | 10327485 |
11 | 5914213 |
12 | 3560679 |
13 | 21a794c |
14 | 152b937 |
15 | d8eee0 |
hex | 9d95bd |
10327485 has 24 divisors (see below), whose sum is σ = 19223136. Its totient is φ = 4720800.
The previous prime is 10327481. The next prime is 10327489. The reversal of 10327485 is 58472301.
10327485 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (10327481) and next prime (10327489).
It is not a de Polignac number, because 10327485 - 22 = 10327481 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10327481) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 6291 + ... + 7760.
It is an arithmetic number, because the mean of its divisors is an integer number (800964).
Almost surely, 210327485 is an apocalyptic number.
10327485 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
10327485 is a deficient number, since it is larger than the sum of its proper divisors (8895651).
10327485 is a wasteful number, since it uses less digits than its factorization.
10327485 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14073 (or 14066 counting only the distinct ones).
The product of its (nonzero) digits is 6720, while the sum is 30.
The square root of 10327485 is about 3213.6404590433. The cubic root of 10327485 is about 217.7700701165.
Adding to 10327485 its reverse (58472301), we get a palindrome (68799786).
The spelling of 10327485 in words is "ten million, three hundred twenty-seven thousand, four hundred eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •