Base | Representation |
---|---|
bin | 101000000010… |
… | …101100101000 |
3 | 201202021220200 |
4 | 220002230220 |
5 | 10141344213 |
6 | 1012552200 |
7 | 155135640 |
oct | 50025450 |
9 | 21667820 |
10 | 10496808 |
11 | 5a1a453 |
12 | 3622660 |
13 | 2236a3a |
14 | 1573520 |
15 | dc5273 |
hex | a02b28 |
10496808 has 96 divisors (see below), whose sum is σ = 33134400. Its totient is φ = 2939904.
The previous prime is 10496791. The next prime is 10496831. The reversal of 10496808 is 80869401.
It is a happy number.
It is a super-2 number, since 2×104968082 = 220365956377728, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 29560 + ... + 29912.
It is an arithmetic number, because the mean of its divisors is an integer number (345150).
Almost surely, 210496808 is an apocalyptic number.
10496808 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10496808, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16567200).
10496808 is an abundant number, since it is smaller than the sum of its proper divisors (22637592).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10496808 is a wasteful number, since it uses less digits than its factorization.
10496808 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 431 (or 424 counting only the distinct ones).
The product of its (nonzero) digits is 13824, while the sum is 36.
The square root of 10496808 is about 3239.8777754724. The cubic root of 10496808 is about 218.9537651818.
The spelling of 10496808 in words is "ten million, four hundred ninety-six thousand, eight hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •