Base | Representation |
---|---|
bin | 101000000010… |
… | …111100110000 |
3 | 201202100022220 |
4 | 220002330300 |
5 | 10141412330 |
6 | 1013001040 |
7 | 155141643 |
oct | 50027460 |
9 | 21670286 |
10 | 10497840 |
11 | 5a20201 |
12 | 3623180 |
13 | 2237352 |
14 | 1573a5a |
15 | dc5710 |
hex | a02f30 |
10497840 has 160 divisors (see below), whose sum is σ = 35997696. Its totient is φ = 2519040.
The previous prime is 10497827. The next prime is 10497841. The reversal of 10497840 is 4879401.
It is a super-2 number, since 2×104978402 = 220409289331200, which contains 22 as substring.
It is a hoax number, since the sum of its digits (33) coincides with the sum of the digits of its distinct prime factors.
It is not an unprimeable number, because it can be changed into a prime (10497841) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 126439 + ... + 126521.
Almost surely, 210497840 is an apocalyptic number.
10497840 is a gapful number since it is divisible by the number (10) 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 10497840, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (17998848).
10497840 is an abundant number, since it is smaller than the sum of its proper divisors (25499856).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10497840 is a wasteful number, since it uses less digits than its factorization.
10497840 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 147 (or 141 counting only the distinct ones).
The product of its (nonzero) digits is 8064, while the sum is 33.
The square root of 10497840 is about 3240.0370368254. The cubic root of 10497840 is about 218.9609404704.
The spelling of 10497840 in words is "ten million, four hundred ninety-seven thousand, eight hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •