Base | Representation |
---|---|
bin | 1010001100101100011101… |
… | …01000110000101010010001 |
3 | 2221101221111120200201111012 |
4 | 11012112032220300222101 |
5 | 10414413300312132121 |
6 | 115410315345500305 |
7 | 4503153345546425 |
oct | 506261650605221 |
9 | 87357446621435 |
10 | 22426417302161 |
11 | 7166a98a03344 |
12 | 2622481941695 |
13 | c68a57218882 |
14 | 577631590b85 |
15 | 28d568a90c5b |
hex | 14658ea30a91 |
22426417302161 has 2 divisors, whose sum is σ = 22426417302162. Its totient is φ = 22426417302160.
The previous prime is 22426417302109. The next prime is 22426417302197. The reversal of 22426417302161 is 16120371462422.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 21622267500625 + 804149801536 = 4649975^2 + 896744^2 .
It is a cyclic number.
It is not a de Polignac number, because 22426417302161 - 210 = 22426417301137 is a prime.
It is not a weakly prime, because it can be changed into another prime (22426417302061) 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, 11213208651080 + 11213208651081.
It is an arithmetic number, because the mean of its divisors is an integer number (11213208651081).
Almost surely, 222426417302161 is an apocalyptic number.
It is an amenable number.
22426417302161 is a deficient number, since it is larger than the sum of its proper divisors (1).
22426417302161 is an equidigital number, since it uses as much as digits as its factorization.
22426417302161 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 193536, while the sum is 41.
Adding to 22426417302161 its reverse (16120371462422), we get a palindrome (38546788764583).
The spelling of 22426417302161 in words is "twenty-two trillion, four hundred twenty-six billion, four hundred seventeen million, three hundred two thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •