Base | Representation |
---|---|
bin | 1010000110001110100101… |
… | …0101111000100101111011 |
3 | 1110022100111011020102202212 |
4 | 2201203221111320211323 |
5 | 2423344110220233034 |
6 | 35340123350045335 |
7 | 2224046433453254 |
oct | 241435125704573 |
9 | 43270434212685 |
10 | 11102110321019 |
11 | 35a0418932473 |
12 | 12b37b634984b |
13 | 626c031c6353 |
14 | 2a54b89abb2b |
15 | 143bd0ce92ce |
hex | a18e957897b |
11102110321019 has 2 divisors, whose sum is σ = 11102110321020. Its totient is φ = 11102110321018.
The previous prime is 11102110320989. The next prime is 11102110321021. The reversal of 11102110321019 is 91012301120111.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11102110321019 is a prime.
It is a super-2 number, since 2×111021103210192 (a number of 27 digits) contains 22 as substring.
Together with 11102110321021, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 11102110320985 and 11102110321003.
It is not a weakly prime, because it can be changed into another prime (11102110321619) 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, 5551055160509 + 5551055160510.
It is an arithmetic number, because the mean of its divisors is an integer number (5551055160510).
Almost surely, 211102110321019 is an apocalyptic number.
11102110321019 is a deficient number, since it is larger than the sum of its proper divisors (1).
11102110321019 is an equidigital number, since it uses as much as digits as its factorization.
11102110321019 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 23.
The spelling of 11102110321019 in words is "eleven trillion, one hundred two billion, one hundred ten million, three hundred twenty-one thousand, nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •