Base | Representation |
---|---|
bin | 1010000110001110001101… |
… | …01110100010100110010011 |
3 | 2220121200110100000100012112 |
4 | 11003013012232202212103 |
5 | 10402242313112322011 |
6 | 115120215212415535 |
7 | 4451121213203264 |
oct | 503070656424623 |
9 | 86550410010175 |
10 | 22204020042131 |
11 | 7090743502194 |
12 | 25a73554775ab |
13 | c50aa3985315 |
14 | 56a974a7c96b |
15 | 28789e1bb58b |
hex | 1431c6ba2993 |
22204020042131 has 2 divisors, whose sum is σ = 22204020042132. Its totient is φ = 22204020042130.
The previous prime is 22204020042101. The next prime is 22204020042133. The reversal of 22204020042131 is 13124002040222.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 22204020042131 - 218 = 22204019779987 is a prime.
It is a super-2 number, since 2×222040200421312 (a number of 27 digits) contains 22 as substring.
Together with 22204020042133, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 22204020042097 and 22204020042106.
It is not a weakly prime, because it can be changed into another prime (22204020042133) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11102010021065 + 11102010021066.
It is an arithmetic number, because the mean of its divisors is an integer number (11102010021066).
Almost surely, 222204020042131 is an apocalyptic number.
22204020042131 is a deficient number, since it is larger than the sum of its proper divisors (1).
22204020042131 is an equidigital number, since it uses as much as digits as its factorization.
22204020042131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1536, while the sum is 23.
Adding to 22204020042131 its reverse (13124002040222), we get a palindrome (35328022082353).
The spelling of 22204020042131 in words is "twenty-two trillion, two hundred four billion, twenty million, forty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •