Base | Representation |
---|---|
bin | 10100011101001010… |
… | …11011010010011111 |
3 | 1001100100210000021102 |
4 | 22032211123102133 |
5 | 134442410012432 |
6 | 5013424423315 |
7 | 536101253324 |
oct | 121645332237 |
9 | 31310700242 |
10 | 10982110367 |
11 | 472612a078 |
12 | 2165a77b3b |
13 | 1060302977 |
14 | 762774b4b |
15 | 444208962 |
hex | 28e95b49f |
10982110367 has 2 divisors, whose sum is σ = 10982110368. Its totient is φ = 10982110366.
The previous prime is 10982110327. The next prime is 10982110423. The reversal of 10982110367 is 76301128901.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 10982110367 - 26 = 10982110303 is a prime.
It is a super-2 number, since 2×109821103672 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10982110367.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10982110327) 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 as a sum of consecutive naturals, namely, 5491055183 + 5491055184.
It is an arithmetic number, because the mean of its divisors is an integer number (5491055184).
Almost surely, 210982110367 is an apocalyptic number.
10982110367 is a deficient number, since it is larger than the sum of its proper divisors (1).
10982110367 is an equidigital number, since it uses as much as digits as its factorization.
10982110367 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18144, while the sum is 38.
The spelling of 10982110367 in words is "ten billion, nine hundred eighty-two million, one hundred ten thousand, three hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •