Base | Representation |
---|---|
bin | 1010000111010001100111… |
… | …0011101010100000010111 |
3 | 1110101001221010012122010222 |
4 | 2201310121303222200113 |
5 | 2424142432421200231 |
6 | 35352301022104555 |
7 | 2225254345336241 |
oct | 241643163524027 |
9 | 43331833178128 |
10 | 11120103303191 |
11 | 35a8011461273 |
12 | 12b719811b15b |
13 | 62880cb3a56c |
14 | 2a63044cd091 |
15 | 1443d576827b |
hex | a1d19cea817 |
11120103303191 has 2 divisors, whose sum is σ = 11120103303192. Its totient is φ = 11120103303190.
The previous prime is 11120103303031. The next prime is 11120103303193. The reversal of 11120103303191 is 19130330102111.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11120103303191 is a prime.
Together with 11120103303193, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11120103303191.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11120103303193) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5560051651595 + 5560051651596.
It is an arithmetic number, because the mean of its divisors is an integer number (5560051651596).
Almost surely, 211120103303191 is an apocalyptic number.
11120103303191 is a deficient number, since it is larger than the sum of its proper divisors (1).
11120103303191 is an equidigital number, since it uses as much as digits as its factorization.
11120103303191 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 486, while the sum is 26.
The spelling of 11120103303191 in words is "eleven trillion, one hundred twenty billion, one hundred three million, three hundred three thousand, one hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •