Base | Representation |
---|---|
bin | 1001000110101101001101… |
… | …10100010001011101100001 |
3 | 2121220001100121100211010012 |
4 | 10203112212310101131201 |
5 | 10111013310132200041 |
6 | 110325452014014305 |
7 | 4134341635645406 |
oct | 443264664213541 |
9 | 77801317324105 |
10 | 20021641287521 |
11 | 641a1485a8725 |
12 | 22b43b31a7395 |
13 | b23056a1c003 |
14 | 4d30a45042ad |
15 | 24ac1ec593eb |
hex | 1235a6d11761 |
20021641287521 has 2 divisors, whose sum is σ = 20021641287522. Its totient is φ = 20021641287520.
The previous prime is 20021641287491. The next prime is 20021641287559. The reversal of 20021641287521 is 12578214612002.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 18895843894225 + 1125797393296 = 4346935^2 + 1061036^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20021641287521 is a prime.
It is a super-2 number, since 2×200216412875212 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (20021641287421) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10010820643760 + 10010820643761.
It is an arithmetic number, because the mean of its divisors is an integer number (10010820643761).
Almost surely, 220021641287521 is an apocalyptic number.
It is an amenable number.
20021641287521 is a deficient number, since it is larger than the sum of its proper divisors (1).
20021641287521 is an equidigital number, since it uses as much as digits as its factorization.
20021641287521 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 107520, while the sum is 41.
Adding to 20021641287521 its reverse (12578214612002), we get a palindrome (32599855899523).
The spelling of 20021641287521 in words is "twenty trillion, twenty-one billion, six hundred forty-one million, two hundred eighty-seven thousand, five hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •