Base | Representation |
---|---|
bin | 110000000000111100000000… |
… | …0100101111110111111111101 |
3 | 2001101101102210000222100111121 |
4 | 1200001320000211332333331 |
5 | 420324120012423322422 |
6 | 4054124531544550541 |
7 | 154650103503652135 |
oct | 14001700045767775 |
9 | 2041342700870447 |
10 | 422341324042237 |
11 | 112630a4a008336 |
12 | 3b4506b2a82451 |
13 | 1518780137c242 |
14 | 7641601843ac5 |
15 | 33c61014c68c7 |
hex | 1801e0097effd |
422341324042237 has 2 divisors, whose sum is σ = 422341324042238. Its totient is φ = 422341324042236.
The previous prime is 422341324042219. The next prime is 422341324042241. The reversal of 422341324042237 is 732240423143224.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 409556365775001 + 12784958267236 = 20237499^2 + 3575606^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-422341324042237 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 422341324042193 and 422341324042202.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (422341304042237) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 211170662021118 + 211170662021119.
It is an arithmetic number, because the mean of its divisors is an integer number (211170662021119).
Almost surely, 2422341324042237 is an apocalyptic number.
It is an amenable number.
422341324042237 is a deficient number, since it is larger than the sum of its proper divisors (1).
422341324042237 is an equidigital number, since it uses as much as digits as its factorization.
422341324042237 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1548288, while the sum is 43.
The spelling of 422341324042237 in words is "four hundred twenty-two trillion, three hundred forty-one billion, three hundred twenty-four million, forty-two thousand, two hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •