Base | Representation |
---|---|
bin | 101000010001… |
… | …001101010000 |
3 | 201212022102212 |
4 | 220101031100 |
5 | 10200244430 |
6 | 1014131252 |
7 | 155504132 |
oct | 50211520 |
9 | 21768385 |
10 | 10556240 |
11 | 5a60072 |
12 | 3650b28 |
13 | 2257ac6 |
14 | 158b052 |
15 | dd7b95 |
hex | a11350 |
10556240 has 40 divisors (see below), whose sum is σ = 24760320. Its totient is φ = 4185216.
The previous prime is 10556239. The next prime is 10556279. The reversal of 10556240 is 4265501.
It is a tau number, because it is divible by the number of its divisors (40).
It is a super-2 number, since 2×105562402 = 222868405875200, which contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9641 + ... + 10679.
It is an arithmetic number, because the mean of its divisors is an integer number (619008).
Almost surely, 210556240 is an apocalyptic number.
10556240 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 10556240, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (12380160).
10556240 is an abundant number, since it is smaller than the sum of its proper divisors (14204080).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10556240 is a wasteful number, since it uses less digits than its factorization.
10556240 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1179 (or 1173 counting only the distinct ones).
The product of its (nonzero) digits is 1200, while the sum is 23.
The square root of 10556240 is about 3249.0367803397. The cubic root of 10556240 is about 219.3662200256.
The spelling of 10556240 in words is "ten million, five hundred fifty-six thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •