Base | Representation |
---|---|
bin | 1001101011111100001111… |
… | …11011010110011000110101 |
3 | 2210102100122221100011000012 |
4 | 10311332013323112120311 |
5 | 10242443443431200341 |
6 | 113145315514430005 |
7 | 4325643133441514 |
oct | 465760773263065 |
9 | 83370587304005 |
10 | 21301023303221 |
11 | 687279337a072 |
12 | 2480345732305 |
13 | bb68a73b712c |
14 | 538d9169c67b |
15 | 26e14da420eb |
hex | 135f87ed6635 |
21301023303221 has 2 divisors, whose sum is σ = 21301023303222. Its totient is φ = 21301023303220.
The previous prime is 21301023303193. The next prime is 21301023303223. The reversal of 21301023303221 is 12230332010312.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 19222700296900 + 2078323006321 = 4384370^2 + 1441639^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-21301023303221 is a prime.
Together with 21301023303223, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (21301023303223) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10650511651610 + 10650511651611.
It is an arithmetic number, because the mean of its divisors is an integer number (10650511651611).
Almost surely, 221301023303221 is an apocalyptic number.
It is an amenable number.
21301023303221 is a deficient number, since it is larger than the sum of its proper divisors (1).
21301023303221 is an equidigital number, since it uses as much as digits as its factorization.
21301023303221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 21301023303221 its reverse (12230332010312), we get a palindrome (33531355313533).
The spelling of 21301023303221 in words is "twenty-one trillion, three hundred one billion, twenty-three million, three hundred three thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •