Base | Representation |
---|---|
bin | 1010001100100100010011… |
… | …0111010101111101000001 |
3 | 1110200202121021000102101022 |
4 | 2203021010313111331001 |
5 | 2432140132110013324 |
6 | 35502134350315225 |
7 | 2234653345455356 |
oct | 243110467257501 |
9 | 43622537012338 |
10 | 11211020001089 |
11 | 363262657a027 |
12 | 131092bab8b15 |
13 | 63426b85161c |
14 | 2aa88b05262d |
15 | 14695731e05e |
hex | a3244dd5f41 |
11211020001089 has 2 divisors, whose sum is σ = 11211020001090. Its totient is φ = 11211020001088.
The previous prime is 11211020001047. The next prime is 11211020001091. The reversal of 11211020001089 is 98010002011211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7108531789489 + 4102488211600 = 2666183^2 + 2025460^2 .
It is a cyclic number.
It is not a de Polignac number, because 11211020001089 - 216 = 11211019935553 is a prime.
It is a super-2 number, since 2×112110200010892 (a number of 27 digits) contains 22 as substring.
It is a Sophie Germain prime.
Together with 11211020001091, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (11211020001989) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5605510000544 + 5605510000545.
It is an arithmetic number, because the mean of its divisors is an integer number (5605510000545).
Almost surely, 211211020001089 is an apocalyptic number.
It is an amenable number.
11211020001089 is a deficient number, since it is larger than the sum of its proper divisors (1).
11211020001089 is an equidigital number, since it uses as much as digits as its factorization.
11211020001089 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 288, while the sum is 26.
The spelling of 11211020001089 in words is "eleven trillion, two hundred eleven billion, twenty million, one thousand, eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •