Base | Representation |
---|---|
bin | 1010000100001010011111… |
… | …00110101010010100100001 |
3 | 2220100220220212120011000121 |
4 | 11002011033212222110201 |
5 | 10400113000303324134 |
6 | 115023522031520241 |
7 | 4443035566644016 |
oct | 502051746522441 |
9 | 86326825504017 |
10 | 22133302011169 |
11 | 7063753a758a8 |
12 | 25956ba089081 |
13 | c4721385749b |
14 | 56738695770d |
15 | 285b10a25ab4 |
hex | 14214f9aa521 |
22133302011169 has 2 divisors, whose sum is σ = 22133302011170. Its totient is φ = 22133302011168.
The previous prime is 22133302011113. The next prime is 22133302011193. The reversal of 22133302011169 is 96111020333122.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 20504776368400 + 1628525642769 = 4528220^2 + 1276137^2 .
It is a cyclic number.
It is not a de Polignac number, because 22133302011169 - 215 = 22133301978401 is a prime.
It is a super-2 number, since 2×221333020111692 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (22133302021169) 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, 11066651005584 + 11066651005585.
It is an arithmetic number, because the mean of its divisors is an integer number (11066651005585).
Almost surely, 222133302011169 is an apocalyptic number.
It is an amenable number.
22133302011169 is a deficient number, since it is larger than the sum of its proper divisors (1).
22133302011169 is an equidigital number, since it uses as much as digits as its factorization.
22133302011169 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11664, while the sum is 34.
The spelling of 22133302011169 in words is "twenty-two trillion, one hundred thirty-three billion, three hundred two million, eleven thousand, one hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •