Base | Representation |
---|---|
bin | 10100100001101100… |
… | …00010110111001001 |
3 | 1001110000010002011002 |
4 | 22100312002313021 |
5 | 140032111134233 |
6 | 5021301144345 |
7 | 540041430446 |
oct | 122066026711 |
9 | 31400102132 |
10 | 11020021193 |
11 | 4745573035 |
12 | 21766bb0b5 |
13 | 10681175cc |
14 | 7678029cd |
15 | 4476e66e8 |
hex | 290d82dc9 |
11020021193 has 2 divisors, whose sum is σ = 11020021194. Its totient is φ = 11020021192.
The previous prime is 11020021043. The next prime is 11020021213. The reversal of 11020021193 is 39112002011.
It is an a-pointer prime, because the next prime (11020021213) can be obtained adding 11020021193 to its sum of digits (20).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8261355664 + 2758665529 = 90892^2 + 52523^2 .
It is an emirp because it is prime and its reverse (39112002011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11020021193 - 28 = 11020020937 is a prime.
It is not a weakly prime, because it can be changed into another prime (11020021393) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5510010596 + 5510010597.
It is an arithmetic number, because the mean of its divisors is an integer number (5510010597).
Almost surely, 211020021193 is an apocalyptic number.
It is an amenable number.
11020021193 is a deficient number, since it is larger than the sum of its proper divisors (1).
11020021193 is an equidigital number, since it uses as much as digits as its factorization.
11020021193 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 20.
The spelling of 11020021193 in words is "eleven billion, twenty million, twenty-one thousand, one hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •