Base | Representation |
---|---|
bin | 10000000001011111010… |
… | …001101110101100000011 |
3 | 10220021011020221020201012 |
4 | 100001133101232230003 |
5 | 121020033142022404 |
6 | 2201502031031135 |
7 | 142360351341464 |
oct | 20013721565403 |
9 | 3807136836635 |
10 | 1101110110979 |
11 | 394a83a5188a |
12 | 15949b66b4ab |
13 | 7caaca89188 |
14 | 3b418ab8d6b |
15 | 1d998182a6e |
hex | 1005f46eb03 |
1101110110979 has 2 divisors, whose sum is σ = 1101110110980. Its totient is φ = 1101110110978.
The previous prime is 1101110110939. The next prime is 1101110110987. The reversal of 1101110110979 is 9790110111011.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1101110110979 - 212 = 1101110106883 is a prime.
It is not a weakly prime, because it can be changed into another prime (1101110110939) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 550555055489 + 550555055490.
It is an arithmetic number, because the mean of its divisors is an integer number (550555055490).
Almost surely, 21101110110979 is an apocalyptic number.
1101110110979 is a deficient number, since it is larger than the sum of its proper divisors (1).
1101110110979 is an equidigital number, since it uses as much as digits as its factorization.
1101110110979 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 567, while the sum is 32.
Adding to 1101110110979 its sum of digits (32), we get a palindrome (1101110111011).
The spelling of 1101110110979 in words is "one trillion, one hundred one billion, one hundred ten million, one hundred ten thousand, nine hundred seventy-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •