Base | Representation |
---|---|
bin | 10001110011000110… |
… | …010101110001111101 |
3 | 1211022212112212120021 |
4 | 101303012111301331 |
5 | 303114343123401 |
6 | 12440205052141 |
7 | 1244405030662 |
oct | 216306256175 |
9 | 54285485507 |
10 | 19110911101 |
11 | 811767a407 |
12 | 3854257051 |
13 | 1a57431729 |
14 | cd41a9a69 |
15 | 76cb972a1 |
hex | 473195c7d |
19110911101 has 2 divisors, whose sum is σ = 19110911102. Its totient is φ = 19110911100.
The previous prime is 19110911089. The next prime is 19110911111. The reversal of 19110911101 is 10111901191.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 18126583225 + 984327876 = 134635^2 + 31374^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-19110911101 is a prime.
It is a super-2 number, since 2×191109111012 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (19110911111) 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, 9555455550 + 9555455551.
It is an arithmetic number, because the mean of its divisors is an integer number (9555455551).
Almost surely, 219110911101 is an apocalyptic number.
It is an amenable number.
19110911101 is a deficient number, since it is larger than the sum of its proper divisors (1).
19110911101 is an equidigital number, since it uses as much as digits as its factorization.
19110911101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 81, while the sum is 25.
The spelling of 19110911101 in words is "nineteen billion, one hundred ten million, nine hundred eleven thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •