Base | Representation |
---|---|
bin | 10101000100010101… |
… | …011101110001110001 |
3 | 2011101111222211021102 |
4 | 111010111131301301 |
5 | 332312024023121 |
6 | 14220405134145 |
7 | 1430401666145 |
oct | 250425356161 |
9 | 64344884242 |
10 | 22621314161 |
11 | 9659162166 |
12 | 44739ba355 |
13 | 21967a11c4 |
14 | 11484b5225 |
15 | 8c5e5b90b |
hex | 54455dc71 |
22621314161 has 2 divisors, whose sum is σ = 22621314162. Its totient is φ = 22621314160.
The previous prime is 22621314151. The next prime is 22621314181. The reversal of 22621314161 is 16141312622.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 19392233536 + 3229080625 = 139256^2 + 56825^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-22621314161 is a prime.
It is a super-3 number, since 3×226213141613 (a number of 32 digits) contains 333 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (22621314151) 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, 11310657080 + 11310657081.
It is an arithmetic number, because the mean of its divisors is an integer number (11310657081).
Almost surely, 222621314161 is an apocalyptic number.
It is an amenable number.
22621314161 is a deficient number, since it is larger than the sum of its proper divisors (1).
22621314161 is an equidigital number, since it uses as much as digits as its factorization.
22621314161 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 3456, while the sum is 29.
Adding to 22621314161 its reverse (16141312622), we get a palindrome (38762626783).
The spelling of 22621314161 in words is "twenty-two billion, six hundred twenty-one million, three hundred fourteen thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.128 sec. • engine limits •