Base | Representation |
---|---|
bin | 10000001001111000111… |
… | …110001100011001001011 |
3 | 10221010102221120121010002 |
4 | 100021320332030121023 |
5 | 121142022032210404 |
6 | 2205553122513215 |
7 | 143130040633322 |
oct | 20117076143113 |
9 | 3833387517102 |
10 | 1110131131979 |
11 | 3988930a0441 |
12 | 15b19880580b |
13 | 808b99b951c |
14 | 3ba32c030b9 |
15 | 1dd25112c1e |
hex | 10278f8c64b |
1110131131979 has 2 divisors, whose sum is σ = 1110131131980. Its totient is φ = 1110131131978.
The previous prime is 1110131131943. The next prime is 1110131132119. The reversal of 1110131131979 is 9791311310111.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1110131131979 - 232 = 1105836164683 is a prime.
It is a super-2 number, since 2×11101311319792 (a number of 25 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is not a weakly prime, because it can be changed into another prime (1110131181979) 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, 555065565989 + 555065565990.
It is an arithmetic number, because the mean of its divisors is an integer number (555065565990).
Almost surely, 21110131131979 is an apocalyptic number.
1110131131979 is a deficient number, since it is larger than the sum of its proper divisors (1).
1110131131979 is an equidigital number, since it uses as much as digits as its factorization.
1110131131979 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5103, while the sum is 38.
The spelling of 1110131131979 in words is "one trillion, one hundred ten billion, one hundred thirty-one million, one hundred thirty-one thousand, nine hundred seventy-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •