Base | Representation |
---|---|
bin | 1010000110101100011000… |
… | …10100011001100010011001 |
3 | 2220200020021100001110002202 |
4 | 11003112030110121202121 |
5 | 10403024002303324204 |
6 | 115131454513335545 |
7 | 4452233523331526 |
oct | 503261424314231 |
9 | 86606240043082 |
10 | 22220219979929 |
11 | 70975a6998234 |
12 | 25aa5168675b5 |
13 | c52485ca342a |
14 | 56b6703b814d |
15 | 287eeb507e1e |
hex | 14358c519899 |
22220219979929 has 2 divisors, whose sum is σ = 22220219979930. Its totient is φ = 22220219979928.
The previous prime is 22220219979913. The next prime is 22220219979931. The reversal of 22220219979929 is 92997991202222.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 17681394255625 + 4538825724304 = 4204925^2 + 2130452^2 .
It is a cyclic number.
It is not a de Polignac number, because 22220219979929 - 24 = 22220219979913 is a prime.
Together with 22220219979931, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (22220219979949) 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, 11110109989964 + 11110109989965.
It is an arithmetic number, because the mean of its divisors is an integer number (11110109989965).
Almost surely, 222220219979929 is an apocalyptic number.
It is an amenable number.
22220219979929 is a deficient number, since it is larger than the sum of its proper divisors (1).
22220219979929 is an equidigital number, since it uses as much as digits as its factorization.
22220219979929 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 26453952, while the sum is 65.
The spelling of 22220219979929 in words is "twenty-two trillion, two hundred twenty billion, two hundred nineteen million, nine hundred seventy-nine thousand, nine hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •