Base | Representation |
---|---|
bin | 1010000000010010010001… |
… | …1010001110110100010101 |
3 | 1102221120222110020112112221 |
4 | 2200010210122032310111 |
5 | 2420211021124220034 |
6 | 35221201305142341 |
7 | 2213503542063445 |
oct | 240044432166425 |
9 | 42846873215487 |
10 | 11000022101269 |
11 | 35610a0784a23 |
12 | 1297a6518a9b1 |
13 | 61a3b3b91a26 |
14 | 2a059248a125 |
15 | 1412085c2bb4 |
hex | a012468ed15 |
11000022101269 has 2 divisors, whose sum is σ = 11000022101270. Its totient is φ = 11000022101268.
The previous prime is 11000022101209. The next prime is 11000022101317. The reversal of 11000022101269 is 96210122000011.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5588992451025 + 5411029650244 = 2364105^2 + 2326162^2 .
It is a cyclic number.
It is not a de Polignac number, because 11000022101269 - 213 = 11000022093077 is a prime.
It is a super-2 number, since 2×110000221012692 (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 (11000022101209) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5500011050634 + 5500011050635.
It is an arithmetic number, because the mean of its divisors is an integer number (5500011050635).
Almost surely, 211000022101269 is an apocalyptic number.
It is an amenable number.
11000022101269 is a deficient number, since it is larger than the sum of its proper divisors (1).
11000022101269 is an equidigital number, since it uses as much as digits as its factorization.
11000022101269 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 25.
The spelling of 11000022101269 in words is "eleven trillion, twenty-two million, one hundred one thousand, two hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •