Base | Representation |
---|---|
bin | 1010000000010010101110… |
… | …1111111001101000011001 |
3 | 1102221121022000220201200021 |
4 | 2200010223233321220121 |
5 | 2420211244134102134 |
6 | 35221221424110441 |
7 | 2213506565433505 |
oct | 240045357715031 |
9 | 42847260821607 |
10 | 11000145222169 |
11 | 3561154228534 |
12 | 1297a9a465421 |
13 | 61a40353c32c |
14 | 2a05a4979305 |
15 | 1412142e30b4 |
hex | a012bbf9a19 |
11000145222169 has 2 divisors, whose sum is σ = 11000145222170. Its totient is φ = 11000145222168.
The previous prime is 11000145222139. The next prime is 11000145222247. The reversal of 11000145222169 is 96122254100011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10257850972944 + 742294249225 = 3202788^2 + 861565^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11000145222169 is a prime.
It is a super-2 number, since 2×110001452221692 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (11000145222139) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5500072611084 + 5500072611085.
It is an arithmetic number, because the mean of its divisors is an integer number (5500072611085).
Almost surely, 211000145222169 is an apocalyptic number.
It is an amenable number.
11000145222169 is a deficient number, since it is larger than the sum of its proper divisors (1).
11000145222169 is an equidigital number, since it uses as much as digits as its factorization.
11000145222169 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8640, while the sum is 34.
The spelling of 11000145222169 in words is "eleven trillion, one hundred forty-five million, two hundred twenty-two thousand, one hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •