Base | Representation |
---|---|
bin | 101000110001… |
… | …101100100000 |
3 | 202010001222110 |
4 | 220301230200 |
5 | 10214024222 |
6 | 1021035320 |
7 | 156600114 |
oct | 50615440 |
9 | 22101873 |
10 | 10689312 |
11 | 6041047 |
12 | 36b5b40 |
13 | 22a354a |
14 | 15c3744 |
15 | e1230c |
hex | a31b20 |
10689312 has 24 divisors (see below), whose sum is σ = 28059696. Its totient is φ = 3563072.
The previous prime is 10689293. The next prime is 10689347. The reversal of 10689312 is 21398601.
It is a tau number, because it is divible by the number of its divisors (24).
It is a super-2 number, since 2×106893122 = 228522782066688, which contains 22 as substring.
It is a Smith number, since the sum of its digits (30) coincides with the sum of the digits of its prime factors.
It is a self number, because there is not a number n which added to its sum of digits gives 10689312.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 55578 + ... + 55769.
It is an arithmetic number, because the mean of its divisors is an integer number (1169154).
Almost surely, 210689312 is an apocalyptic number.
10689312 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10689312 is an abundant number, since it is smaller than the sum of its proper divisors (17370384).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10689312 is a wasteful number, since it uses less digits than its factorization.
10689312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 111360 (or 111352 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 30.
The square root of 10689312 is about 3269.4513301164. The cubic root of 10689312 is about 220.2841507409.
The spelling of 10689312 in words is "ten million, six hundred eighty-nine thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •