Base | Representation |
---|---|
bin | 100111011001… |
… | …001110010101 |
3 | 201102122220000 |
4 | 213121032111 |
5 | 10120430213 |
6 | 1005201513 |
7 | 153530451 |
oct | 47311625 |
9 | 21378800 |
10 | 10326933 |
11 | 5913861 |
12 | 3560299 |
13 | 21a7616 |
14 | 152b661 |
15 | d8ec73 |
hex | 9d9395 |
10326933 has 10 divisors (see below), whose sum is σ = 15426774. Its totient is φ = 6884568.
The previous prime is 10326919. The next prime is 10326941. The reversal of 10326933 is 33962301.
It can be written as a sum of positive squares in only one way, i.e., 9199089 + 1127844 = 3033^2 + 1062^2 .
It is not a de Polignac number, because 10326933 - 24 = 10326917 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 10326897 and 10326906.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10326913) 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 9 ways as a sum of consecutive naturals, for example, 63666 + ... + 63827.
Almost surely, 210326933 is an apocalyptic number.
It is an amenable number.
10326933 is a deficient number, since it is larger than the sum of its proper divisors (5099841).
10326933 is an equidigital number, since it uses as much as digits as its factorization.
10326933 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 127505 (or 127496 counting only the distinct ones).
The product of its (nonzero) digits is 2916, while the sum is 27.
The square root of 10326933 is about 3213.5545739881. The cubic root of 10326933 is about 217.7661901392.
The spelling of 10326933 in words is "ten million, three hundred twenty-six thousand, nine hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •