Base | Representation |
---|---|
bin | 101000001100… |
… | …011101000000 |
3 | 201211022201200 |
4 | 220030131000 |
5 | 10144134033 |
6 | 1013501200 |
7 | 155363304 |
oct | 50143500 |
9 | 21738650 |
10 | 10536768 |
11 | 5a47480 |
12 | 3641800 |
13 | 224bc98 |
14 | 1583d04 |
15 | dd2013 |
hex | a0c740 |
10536768 has 84 divisors (see below), whose sum is σ = 32967168. Its totient is φ = 3191040.
The previous prime is 10536739. The next prime is 10536781. The reversal of 10536768 is 86763501.
It is a super-2 number, since 2×105367682 = 222046959771648, which contains 22 as substring.
It is a Smith number, since the sum of its digits (36) coincides with the sum of the digits of its prime factors.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 5505 + ... + 7167.
Almost surely, 210536768 is an apocalyptic number.
10536768 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 10536768, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16483584).
10536768 is an abundant number, since it is smaller than the sum of its proper divisors (22430400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10536768 is a wasteful number, since it uses less digits than its factorization.
10536768 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1692 (or 1679 counting only the distinct ones).
The product of its (nonzero) digits is 30240, while the sum is 36.
The square root of 10536768 is about 3246.0388167735. The cubic root of 10536768 is about 219.2312563097.
The spelling of 10536768 in words is "ten million, five hundred thirty-six thousand, seven hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •