Base | Representation |
---|---|
bin | 100110110001… |
… | …010001010000 |
3 | 201010100101210 |
4 | 212301101100 |
5 | 10100211110 |
6 | 1001500120 |
7 | 152246361 |
oct | 46612120 |
9 | 21110353 |
10 | 10163280 |
11 | 5811906 |
12 | 34a1640 |
13 | 214ac9a |
14 | 14c7b68 |
15 | d5b520 |
hex | 9b1450 |
10163280 has 160 divisors (see below), whose sum is σ = 34712064. Its totient is φ = 2449408.
The previous prime is 10163273. The next prime is 10163287. The reversal of 10163280 is 8236101.
It is an interprime number because it is at equal distance from previous prime (10163273) and next prime (10163287).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10163287) 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, 191734 + ... + 191786.
Almost surely, 210163280 is an apocalyptic number.
10163280 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 10163280, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (17356032).
10163280 is an abundant number, since it is smaller than the sum of its proper divisors (24548784).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10163280 is a wasteful number, since it uses less digits than its factorization.
10163280 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 133 (or 127 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 21.
The square root of 10163280 is about 3187.9899623430. The cubic root of 10163280 is about 216.6097312595.
Adding to 10163280 its reverse (8236101), we get a palindrome (18399381).
The spelling of 10163280 in words is "ten million, one hundred sixty-three thousand, two hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •