Base | Representation |
---|---|
bin | 10100100001110100… |
… | …001000101000001101 |
3 | 2002220011012022101011 |
4 | 110201310020220031 |
5 | 330120242321222 |
6 | 14043115445221 |
7 | 1410140124115 |
oct | 244164105015 |
9 | 62804168334 |
10 | 22042151437 |
11 | 9391246689 |
12 | 4331a56811 |
13 | 21037bcb77 |
14 | 10d15d4045 |
15 | 8901a7c77 |
hex | 521d08a0d |
22042151437 has 2 divisors, whose sum is σ = 22042151438. Its totient is φ = 22042151436.
The previous prime is 22042151419. The next prime is 22042151459. The reversal of 22042151437 is 73415124022.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 21193827561 + 848323876 = 145581^2 + 29126^2 .
It is a cyclic number.
It is not a de Polignac number, because 22042151437 - 219 = 22041627149 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 22042151399 and 22042151408.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (22042155437) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11021075718 + 11021075719.
It is an arithmetic number, because the mean of its divisors is an integer number (11021075719).
Almost surely, 222042151437 is an apocalyptic number.
It is an amenable number.
22042151437 is a deficient number, since it is larger than the sum of its proper divisors (1).
22042151437 is an equidigital number, since it uses as much as digits as its factorization.
22042151437 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 13440, while the sum is 31.
Adding to 22042151437 its reverse (73415124022), we get a palindrome (95457275459).
The spelling of 22042151437 in words is "twenty-two billion, forty-two million, one hundred fifty-one thousand, four hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •