Base | Representation |
---|---|
bin | 101000000010… |
… | …110100000000 |
3 | 201202022120011 |
4 | 220002310000 |
5 | 10141403110 |
6 | 1012554304 |
7 | 155140213 |
oct | 50026400 |
9 | 21668504 |
10 | 10497280 |
11 | 5a1a842 |
12 | 3622994 |
13 | 2237011 |
14 | 157377a |
15 | dc548a |
hex | a02d00 |
10497280 has 72 divisors (see below), whose sum is σ = 25754400. Its totient is φ = 4098048.
The previous prime is 10497257. The next prime is 10497281. The reversal of 10497280 is 8279401.
It is a super-2 number, since 2×104972802 = 220385774796800, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10497281) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 75451 + ... + 75589.
It is an arithmetic number, because the mean of its divisors is an integer number (357700).
Almost surely, 210497280 is an apocalyptic number.
10497280 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 10497280, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (12877200).
10497280 is an abundant number, since it is smaller than the sum of its proper divisors (15257120).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10497280 is an equidigital number, since it uses as much as digits as its factorization.
10497280 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 219 (or 205 counting only the distinct ones).
The product of its (nonzero) digits is 4032, while the sum is 31.
The square root of 10497280 is about 3239.9506169076. The cubic root of 10497280 is about 218.9570469613.
The spelling of 10497280 in words is "ten million, four hundred ninety-seven thousand, two hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •