Base | Representation |
---|---|
bin | 1010000000110111110100… |
… | …1110110000101101011011 |
3 | 1102222112222221201200002122 |
4 | 2200031331032300231123 |
5 | 2420342142130414204 |
6 | 35225545432451455 |
7 | 2214311411366024 |
oct | 240157516605533 |
9 | 42875887650078 |
10 | 11010102201179 |
11 | 35653a3729204 |
12 | 12999b8b49b8b |
13 | 61b32c345ba3 |
14 | 2a0c6b0ddc4b |
15 | 1415e85040be |
hex | a037d3b0b5b |
11010102201179 has 2 divisors, whose sum is σ = 11010102201180. Its totient is φ = 11010102201178.
The previous prime is 11010102201073. The next prime is 11010102201209. The reversal of 11010102201179 is 97110220101011.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11010102201179 is a prime.
It is a Sophie Germain prime.
It is not a weakly prime, because it can be changed into another prime (11010102207179) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5505051100589 + 5505051100590.
It is an arithmetic number, because the mean of its divisors is an integer number (5505051100590).
Almost surely, 211010102201179 is an apocalyptic number.
11010102201179 is a deficient number, since it is larger than the sum of its proper divisors (1).
11010102201179 is an equidigital number, since it uses as much as digits as its factorization.
11010102201179 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 252, while the sum is 26.
The spelling of 11010102201179 in words is "eleven trillion, ten billion, one hundred two million, two hundred one thousand, one hundred seventy-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •