Base | Representation |
---|---|
bin | 10100011101001010… |
… | …11011010010100011 |
3 | 1001100100210000021120 |
4 | 22032211123102203 |
5 | 134442410012441 |
6 | 5013424423323 |
7 | 536101253331 |
oct | 121645332243 |
9 | 31310700246 |
10 | 10982110371 |
11 | 472612a081 |
12 | 2165a77b43 |
13 | 106030297b |
14 | 762774b51 |
15 | 444208966 |
hex | 28e95b4a3 |
10982110371 has 8 divisors (see below), whose sum is σ = 15413488320. Its totient is φ = 6936069672.
The previous prime is 10982110367. The next prime is 10982110423. The reversal of 10982110371 is 17301128901.
10982110371 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10982110371 - 22 = 10982110367 is a prime.
It is not an unprimeable number, because it can be changed into a prime (10982110301) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 96334245 + ... + 96334358.
It is an arithmetic number, because the mean of its divisors is an integer number (1926686040).
Almost surely, 210982110371 is an apocalyptic number.
10982110371 is a deficient number, since it is larger than the sum of its proper divisors (4431377949).
10982110371 is a wasteful number, since it uses less digits than its factorization.
10982110371 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 192668625.
The product of its (nonzero) digits is 3024, while the sum is 33.
The spelling of 10982110371 in words is "ten billion, nine hundred eighty-two million, one hundred ten thousand, three hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •