Base | Representation |
---|---|
bin | 1001101001100111011100… |
… | …01010010110101100100001 |
3 | 2210010201110022202212022201 |
4 | 10310303232022112230201 |
5 | 10240141340314242144 |
6 | 113044504320333201 |
7 | 4320114325632043 |
oct | 464635612265441 |
9 | 83121408685281 |
10 | 21221134134049 |
11 | 6841917a91913 |
12 | 246896aa74201 |
13 | bac1b52188b5 |
14 | 535173533a93 |
15 | 26c0251671d4 |
hex | 134cee296b21 |
21221134134049 has 2 divisors, whose sum is σ = 21221134134050. Its totient is φ = 21221134134048.
The previous prime is 21221134134017. The next prime is 21221134134059. The reversal of 21221134134049 is 94043143112212.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 20765702163600 + 455431970449 = 4556940^2 + 674857^2 .
It is a cyclic number.
It is not a de Polignac number, because 21221134134049 - 25 = 21221134134017 is a prime.
It is a super-2 number, since 2×212211341340492 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 21221134133999 and 21221134134017.
It is not a weakly prime, because it can be changed into another prime (21221134134059) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10610567067024 + 10610567067025.
It is an arithmetic number, because the mean of its divisors is an integer number (10610567067025).
Almost surely, 221221134134049 is an apocalyptic number.
It is an amenable number.
21221134134049 is a deficient number, since it is larger than the sum of its proper divisors (1).
21221134134049 is an equidigital number, since it uses as much as digits as its factorization.
21221134134049 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 41472, while the sum is 37.
The spelling of 21221134134049 in words is "twenty-one trillion, two hundred twenty-one billion, one hundred thirty-four million, one hundred thirty-four thousand, forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.131 sec. • engine limits •