Base | Representation |
---|---|
bin | 10000000000100011000… |
… | …100100000001111100011 |
3 | 10220011112212020212000002 |
4 | 100000203010200033203 |
5 | 121011001100322404 |
6 | 2201213505050215 |
7 | 142323334543514 |
oct | 20004304401743 |
9 | 3804485225002 |
10 | 1100100010979 |
11 | 39460585a7a2 |
12 | 15925932696b |
13 | 7c97b723a78 |
14 | 3b36089ca0b |
15 | 1d939658c1e |
hex | 100231203e3 |
1100100010979 has 2 divisors, whose sum is σ = 1100100010980. Its totient is φ = 1100100010978.
The previous prime is 1100100010931. The next prime is 1100100011119. The reversal of 1100100010979 is 9790100010011.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1100100010979 is a prime.
It is not a weakly prime, because it can be changed into another prime (1100100010579) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 550050005489 + 550050005490.
It is an arithmetic number, because the mean of its divisors is an integer number (550050005490).
Almost surely, 21100100010979 is an apocalyptic number.
1100100010979 is a deficient number, since it is larger than the sum of its proper divisors (1).
1100100010979 is an equidigital number, since it uses as much as digits as its factorization.
1100100010979 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 567, while the sum is 29.
The spelling of 1100100010979 in words is "one trillion, one hundred billion, one hundred million, ten thousand, nine hundred seventy-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •