Base | Representation |
---|---|
bin | 1010000011001100110100… |
… | …11001000010011000111001 |
3 | 2220020202110201121221212121 |
4 | 11001212122121002120321 |
5 | 10344042200412230234 |
6 | 115000405040241241 |
7 | 4440454324635553 |
oct | 501463231023071 |
9 | 86222421557777 |
10 | 22100196992569 |
11 | 70507060623a3 |
12 | 258b1bb310221 |
13 | c440690cac97 |
14 | 565925daa4d3 |
15 | 284d245114b4 |
hex | 14199a642639 |
22100196992569 has 2 divisors, whose sum is σ = 22100196992570. Its totient is φ = 22100196992568.
The previous prime is 22100196992551. The next prime is 22100196992579. The reversal of 22100196992569 is 96529969100122.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12581811997225 + 9518384995344 = 3547085^2 + 3085188^2 .
It is a cyclic number.
It is not a de Polignac number, because 22100196992569 - 217 = 22100196861497 is a prime.
It is a super-2 number, since 2×221001969925692 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (22100196992539) 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, 11050098496284 + 11050098496285.
It is an arithmetic number, because the mean of its divisors is an integer number (11050098496285).
Almost surely, 222100196992569 is an apocalyptic number.
It is an amenable number.
22100196992569 is a deficient number, since it is larger than the sum of its proper divisors (1).
22100196992569 is an equidigital number, since it uses as much as digits as its factorization.
22100196992569 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9447840, while the sum is 61.
The spelling of 22100196992569 in words is "twenty-two trillion, one hundred billion, one hundred ninety-six million, nine hundred ninety-two thousand, five hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •