Base | Representation |
---|---|
bin | 10100100001001110… |
… | …010100111011010101 |
3 | 2002212110112202220112 |
4 | 110201032110323111 |
5 | 330110223142331 |
6 | 14042123212405 |
7 | 1406656644566 |
oct | 244116247325 |
9 | 62773482815 |
10 | 22032240341 |
11 | 93866972a1 |
12 | 432a677105 |
13 | 210172c907 |
14 | 10d017416d |
15 | 88e39b32b |
hex | 521394ed5 |
22032240341 has 2 divisors, whose sum is σ = 22032240342. Its totient is φ = 22032240340.
The previous prime is 22032240323. The next prime is 22032240353. The reversal of 22032240341 is 14304223022.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 15587522500 + 6444717841 = 124850^2 + 80279^2 .
It is a cyclic number.
It is not a de Polignac number, because 22032240341 - 214 = 22032223957 is a prime.
It is a super-2 number, since 2×220322403412 (a number of 21 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (22032240311) 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, 11016120170 + 11016120171.
It is an arithmetic number, because the mean of its divisors is an integer number (11016120171).
Almost surely, 222032240341 is an apocalyptic number.
It is an amenable number.
22032240341 is a deficient number, since it is larger than the sum of its proper divisors (1).
22032240341 is an equidigital number, since it uses as much as digits as its factorization.
22032240341 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 23.
Adding to 22032240341 its reverse (14304223022), we get a palindrome (36336463363).
The spelling of 22032240341 in words is "twenty-two billion, thirty-two million, two hundred forty thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •