Base | Representation |
---|---|
bin | 100111011001… |
… | …001101110001 |
3 | 201102122211200 |
4 | 213121031301 |
5 | 10120430042 |
6 | 1005201413 |
7 | 153530400 |
oct | 47311561 |
9 | 21378750 |
10 | 10326897 |
11 | 5913829 |
12 | 3560269 |
13 | 21a75b9 |
14 | 152b637 |
15 | d8ec4c |
hex | 9d9371 |
10326897 has 18 divisors (see below), whose sum is σ = 17352738. Its totient is φ = 5900832.
The previous prime is 10326881. The next prime is 10326913. The reversal of 10326897 is 79862301.
It is an interprime number because it is at equal distance from previous prime (10326881) and next prime (10326913).
It can be written as a sum of positive squares in only one way, i.e., 8520561 + 1806336 = 2919^2 + 1344^2 .
It is not a de Polignac number, because 10326897 - 24 = 10326881 is a prime.
It is not an unprimeable number, because it can be changed into a prime (10326817) 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 17 ways as a sum of consecutive naturals, for example, 11268 + ... + 12149.
It is an arithmetic number, because the mean of its divisors is an integer number (964041).
Almost surely, 210326897 is an apocalyptic number.
It is an amenable number.
10326897 is a deficient number, since it is larger than the sum of its proper divisors (7025841).
10326897 is a wasteful number, since it uses less digits than its factorization.
10326897 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23437 (or 23427 counting only the distinct ones).
The product of its (nonzero) digits is 18144, while the sum is 36.
The square root of 10326897 is about 3213.5489727091. The cubic root of 10326897 is about 217.7659370924.
It can be divided in two parts, 103 and 26897, that added together give a cube (27000 = 303).
The spelling of 10326897 in words is "ten million, three hundred twenty-six thousand, eight hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •