Base | Representation |
---|---|
bin | 1001101101101110000011… |
… | …01100110111010000000001 |
3 | 2210122012101000112221200212 |
4 | 10312313001230313100001 |
5 | 10244444111231020322 |
6 | 113233342354323505 |
7 | 4333235205041246 |
oct | 466670154672001 |
9 | 83565330487625 |
10 | 21362122126337 |
11 | 6896697038203 |
12 | 2490157589595 |
13 | bbc5936a23c5 |
14 | 53bd0a0655cd |
15 | 270a279970e2 |
hex | 136dc1b37401 |
21362122126337 has 2 divisors, whose sum is σ = 21362122126338. Its totient is φ = 21362122126336.
The previous prime is 21362122126307. The next prime is 21362122126339. The reversal of 21362122126337 is 73362122126312.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 20666697892096 + 695424234241 = 4546064^2 + 833921^2 .
It is a cyclic number.
It is not a de Polignac number, because 21362122126337 - 230 = 21361048384513 is a prime.
Together with 21362122126339, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 21362122126294 and 21362122126303.
It is not a weakly prime, because it can be changed into another prime (21362122126339) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10681061063168 + 10681061063169.
It is an arithmetic number, because the mean of its divisors is an integer number (10681061063169).
Almost surely, 221362122126337 is an apocalyptic number.
It is an amenable number.
21362122126337 is a deficient number, since it is larger than the sum of its proper divisors (1).
21362122126337 is an equidigital number, since it uses as much as digits as its factorization.
21362122126337 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 217728, while the sum is 41.
The spelling of 21362122126337 in words is "twenty-one trillion, three hundred sixty-two billion, one hundred twenty-two million, one hundred twenty-six thousand, three hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •