Base | Representation |
---|---|
bin | 1010000000111000010001… |
… | …0100011001111010010001 |
3 | 1102222120022020111102122201 |
4 | 2200032010110121322101 |
5 | 2420342413101334134 |
6 | 35230005321403201 |
7 | 2214314354241364 |
oct | 240160424317221 |
9 | 42876266442581 |
10 | 11010221121169 |
11 | 3565454872596 |
12 | 1299a30939501 |
13 | 61b34ab8234a |
14 | 2a0c7cc180db |
15 | 141603b94914 |
hex | a0384519e91 |
11010221121169 has 2 divisors, whose sum is σ = 11010221121170. Its totient is φ = 11010221121168.
The previous prime is 11010221121143. The next prime is 11010221121203. The reversal of 11010221121169 is 96112112201011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9163576579600 + 1846644541569 = 3027140^2 + 1358913^2 .
It is a cyclic number.
It is not a de Polignac number, because 11010221121169 - 213 = 11010221112977 is a prime.
It is a super-2 number, since 2×110102211211692 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (11010221221169) 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, 5505110560584 + 5505110560585.
It is an arithmetic number, because the mean of its divisors is an integer number (5505110560585).
Almost surely, 211010221121169 is an apocalyptic number.
It is an amenable number.
11010221121169 is a deficient number, since it is larger than the sum of its proper divisors (1).
11010221121169 is an equidigital number, since it uses as much as digits as its factorization.
11010221121169 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 28.
The spelling of 11010221121169 in words is "eleven trillion, ten billion, two hundred twenty-one million, one hundred twenty-one thousand, one hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •