Base | Representation |
---|---|
bin | 10100100111110110… |
… | …011000100001100011 |
3 | 2010011012201110221221 |
4 | 110213312120201203 |
5 | 330322202413011 |
6 | 14101133555511 |
7 | 1412506554352 |
oct | 244766304143 |
9 | 63135643857 |
10 | 22143404131 |
11 | 94334132a2 |
12 | 435b945b97 |
13 | 211b7818c4 |
14 | 1100c2d999 |
15 | 899008971 |
hex | 527d98863 |
22143404131 has 2 divisors, whose sum is σ = 22143404132. Its totient is φ = 22143404130.
The previous prime is 22143404113. The next prime is 22143404147. The reversal of 22143404131 is 13140434122.
Together with previous prime (22143404113) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 22143404131 - 29 = 22143403619 is a prime.
It is a super-2 number, since 2×221434041312 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 22143404096 and 22143404105.
It is not a weakly prime, because it can be changed into another prime (22143474131) 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, 11071702065 + 11071702066.
It is an arithmetic number, because the mean of its divisors is an integer number (11071702066).
Almost surely, 222143404131 is an apocalyptic number.
22143404131 is a deficient number, since it is larger than the sum of its proper divisors (1).
22143404131 is an equidigital number, since it uses as much as digits as its factorization.
22143404131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2304, while the sum is 25.
Adding to 22143404131 its reverse (13140434122), we get a palindrome (35283838253).
The spelling of 22143404131 in words is "twenty-two billion, one hundred forty-three million, four hundred four thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •