Base | Representation |
---|---|
bin | 101000110001… |
… | …000110000000 |
3 | 202002221121012 |
4 | 220301012000 |
5 | 10213434343 |
6 | 1021020052 |
7 | 156556664 |
oct | 50610600 |
9 | 22087535 |
10 | 10686848 |
11 | 603a207 |
12 | 36b4628 |
13 | 22a23a3 |
14 | 15c28a4 |
15 | e11718 |
hex | a31180 |
10686848 has 32 divisors (see below), whose sum is σ = 22032000. Its totient is φ = 5157376.
The previous prime is 10686817. The next prime is 10686857. The reversal of 10686848 is 84868601.
It is a tau number, because it is divible by the number of its divisors (32).
It is a super-2 number, since 2×106868482 = 228417440350208, which contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2273 + ... + 5151.
It is an arithmetic number, because the mean of its divisors is an integer number (688500).
Almost surely, 210686848 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10686848, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (11016000).
10686848 is an abundant number, since it is smaller than the sum of its proper divisors (11345152).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10686848 is an equidigital number, since it uses as much as digits as its factorization.
10686848 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2922 (or 2910 counting only the distinct ones).
The product of its (nonzero) digits is 73728, while the sum is 41.
The square root of 10686848 is about 3269.0744867623. The cubic root of 10686848 is about 220.2672234943.
The spelling of 10686848 in words is "ten million, six hundred eighty-six thousand, eight hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.030 sec. • engine limits •