Base | Representation |
---|---|
bin | 1001111111110100111101… |
… | …0010000010011100001111 |
3 | 1102220211122221012110211101 |
4 | 2133331033102002130033 |
5 | 2420043411232022434 |
6 | 35213420305403531 |
7 | 2213104521415534 |
oct | 237751722023417 |
9 | 42824587173741 |
10 | 10992151439119 |
11 | 3558821a16a64 |
12 | 12964293395a7 |
13 | 61972b394ba6 |
14 | 2a004704cd8b |
15 | 140de7624b14 |
hex | 9ff4f48270f |
10992151439119 has 2 divisors, whose sum is σ = 10992151439120. Its totient is φ = 10992151439118.
The previous prime is 10992151439089. The next prime is 10992151439141. The reversal of 10992151439119 is 91193415129901.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 10992151439119 - 213 = 10992151430927 is a prime.
It is a super-2 number, since 2×109921514391192 (a number of 27 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 10992151439119.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10992151439219) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5496075719559 + 5496075719560.
It is an arithmetic number, because the mean of its divisors is an integer number (5496075719560).
Almost surely, 210992151439119 is an apocalyptic number.
10992151439119 is a deficient number, since it is larger than the sum of its proper divisors (1).
10992151439119 is an equidigital number, since it uses as much as digits as its factorization.
10992151439119 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 787320, while the sum is 55.
The spelling of 10992151439119 in words is "ten trillion, nine hundred ninety-two billion, one hundred fifty-one million, four hundred thirty-nine thousand, one hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •