Base | Representation |
---|---|
bin | 1010000000010110100000… |
… | …11110000001011000011101 |
3 | 2212220101211111211122011022 |
4 | 11000023100132001120131 |
5 | 10340441222411133041 |
6 | 114443420513133525 |
7 | 4430421000255434 |
oct | 500132036013035 |
9 | 85811744748138 |
10 | 22002320021021 |
11 | 701314a063a6a |
12 | 257424455a2a5 |
13 | c37a6b3b00c2 |
14 | 560cbccac11b |
15 | 2824e688c24b |
hex | 1402d078161d |
22002320021021 has 2 divisors, whose sum is σ = 22002320021022. Its totient is φ = 22002320021020.
The previous prime is 22002320020973. The next prime is 22002320021041. The reversal of 22002320021021 is 12012002320022.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 16402419000100 + 5599901020921 = 4049990^2 + 2366411^2 .
It is a cyclic number.
It is not a de Polignac number, because 22002320021021 - 218 = 22002319758877 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (22002320021041) 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, 11001160010510 + 11001160010511.
It is an arithmetic number, because the mean of its divisors is an integer number (11001160010511).
Almost surely, 222002320021021 is an apocalyptic number.
It is an amenable number.
22002320021021 is a deficient number, since it is larger than the sum of its proper divisors (1).
22002320021021 is an equidigital number, since it uses as much as digits as its factorization.
22002320021021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 192, while the sum is 17.
Adding to 22002320021021 its reverse (12012002320022), we get a palindrome (34014322341043).
The spelling of 22002320021021 in words is "twenty-two trillion, two billion, three hundred twenty million, twenty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •