Base | Representation |
---|---|
bin | 1010000000010010010001… |
… | …1010010001011011111101 |
3 | 1102221120222110021002021021 |
4 | 2200010210122101123331 |
5 | 2420211021130040442 |
6 | 35221201305304141 |
7 | 2213503542136642 |
oct | 240044432213375 |
9 | 42846873232237 |
10 | 11000022111997 |
11 | 35610a0791a96 |
12 | 1297a65195051 |
13 | 61a3b3b96889 |
14 | 2a059248ddc9 |
15 | 1412085c5e67 |
hex | a01246916fd |
11000022111997 has 2 divisors, whose sum is σ = 11000022111998. Its totient is φ = 11000022111996.
The previous prime is 11000022111907. The next prime is 11000022112061. The reversal of 11000022111997 is 79911122000011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10415265198361 + 584756913636 = 3227269^2 + 764694^2 .
It is a cyclic number.
It is not a de Polignac number, because 11000022111997 - 223 = 11000013723389 is a prime.
It is a super-2 number, since 2×110000221119972 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11000022111907) 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, 5500011055998 + 5500011055999.
It is an arithmetic number, because the mean of its divisors is an integer number (5500011055999).
Almost surely, 211000022111997 is an apocalyptic number.
It is an amenable number.
11000022111997 is a deficient number, since it is larger than the sum of its proper divisors (1).
11000022111997 is an equidigital number, since it uses as much as digits as its factorization.
11000022111997 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2268, while the sum is 34.
The spelling of 11000022111997 in words is "eleven trillion, twenty-two million, one hundred eleven thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •