Base | Representation |
---|---|
bin | 1010000110001111010101… |
… | …0100101000101000110111 |
3 | 1110022101000011110020200222 |
4 | 2201203311110220220313 |
5 | 2423400013144220434 |
6 | 35340155330124555 |
7 | 2224054424101415 |
oct | 241436524505067 |
9 | 43271004406628 |
10 | 11102311320119 |
11 | 35a0511338028 |
12 | 12b385172075b |
13 | 626c35a40326 |
14 | 2a54d75702b5 |
15 | 143be379e72e |
hex | a18f5528a37 |
11102311320119 has 2 divisors, whose sum is σ = 11102311320120. Its totient is φ = 11102311320118.
The previous prime is 11102311320077. The next prime is 11102311320131. The reversal of 11102311320119 is 91102311320111.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11102311320119 is a prime.
It is a super-2 number, since 2×111023113201192 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11102311320019) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5551155660059 + 5551155660060.
It is an arithmetic number, because the mean of its divisors is an integer number (5551155660060).
Almost surely, 211102311320119 is an apocalyptic number.
11102311320119 is a deficient number, since it is larger than the sum of its proper divisors (1).
11102311320119 is an equidigital number, since it uses as much as digits as its factorization.
11102311320119 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 324, while the sum is 26.
The spelling of 11102311320119 in words is "eleven trillion, one hundred two billion, three hundred eleven million, three hundred twenty thousand, one hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •