Base | Representation |
---|---|
bin | 1010000010001001100001… |
… | …00110101000111101000101 |
3 | 2220010022012110002020201211 |
4 | 11001010300212220331011 |
5 | 10342444144440411031 |
6 | 114532031303251421 |
7 | 4435035015156616 |
oct | 501046046507505 |
9 | 86108173066654 |
10 | 22064062435141 |
11 | 70373530435a1 |
12 | 25841b5a49b71 |
13 | c4082ab1715c |
14 | 563c98d27c0d |
15 | 283e0c070bb1 |
hex | 1411309a8f45 |
22064062435141 has 2 divisors, whose sum is σ = 22064062435142. Its totient is φ = 22064062435140.
The previous prime is 22064062435127. The next prime is 22064062435153. The reversal of 22064062435141 is 14153426046022.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 14169389850625 + 7894672584516 = 3764225^2 + 2809746^2 .
It is a cyclic number.
It is not a de Polignac number, because 22064062435141 - 219 = 22064061910853 is a prime.
It is a super-2 number, since 2×220640624351412 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 22064062435094 and 22064062435103.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (22064062435741) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11032031217570 + 11032031217571.
It is an arithmetic number, because the mean of its divisors is an integer number (11032031217571).
Almost surely, 222064062435141 is an apocalyptic number.
It is an amenable number.
22064062435141 is a deficient number, since it is larger than the sum of its proper divisors (1).
22064062435141 is an equidigital number, since it uses as much as digits as its factorization.
22064062435141 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 276480, while the sum is 40.
The spelling of 22064062435141 in words is "twenty-two trillion, sixty-four billion, sixty-two million, four hundred thirty-five thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •