Base | Representation |
---|---|
bin | 10100011101001100… |
… | …00110111101110110 |
3 | 1001100101010002200110 |
4 | 22032212012331312 |
5 | 134442431224040 |
6 | 5013432323450 |
7 | 536102630031 |
oct | 121646067566 |
9 | 31311102613 |
10 | 10982289270 |
11 | 4726241527 |
12 | 2165b43586 |
13 | 1060366224 |
14 | 7627c0018 |
15 | 444241980 |
hex | 28e986f76 |
10982289270 has 32 divisors (see below), whose sum is σ = 27266375520. Its totient is φ = 2827623680.
The previous prime is 10982289193. The next prime is 10982289277. The reversal of 10982289270 is 7298228901.
It is a super-2 number, since 2×109822892702 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10982289277) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6310791 + ... + 6312530.
It is an arithmetic number, because the mean of its divisors is an integer number (852074235).
Almost surely, 210982289270 is an apocalyptic number.
10982289270 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10982289270 is an abundant number, since it is smaller than the sum of its proper divisors (16284086250).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10982289270 is a wasteful number, since it uses less digits than its factorization.
10982289270 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12623360.
The product of its (nonzero) digits is 290304, while the sum is 48.
The spelling of 10982289270 in words is "ten billion, nine hundred eighty-two million, two hundred eighty-nine thousand, two hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 1.003 sec. • engine limits •