Base | Representation |
---|---|
bin | 1001101100000000011111… |
… | …01100100010110000110001 |
3 | 2210102120112200110101111012 |
4 | 10312000033230202300301 |
5 | 10243013130041414441 |
6 | 113150333524200305 |
7 | 4326053442544043 |
oct | 466001754426061 |
9 | 83376480411435 |
10 | 21303301123121 |
11 | 6873752120956 |
12 | 2480880539095 |
13 | bb6b7b294764 |
14 | 539129dd5a93 |
15 | 26e2339d19eb |
hex | 13600fb22c31 |
21303301123121 has 2 divisors, whose sum is σ = 21303301123122. Its totient is φ = 21303301123120.
The previous prime is 21303301123087. The next prime is 21303301123141. The reversal of 21303301123121 is 12132110330312.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13801700524096 + 7501600599025 = 3715064^2 + 2738905^2 .
It is a cyclic number.
It is not a de Polignac number, because 21303301123121 - 222 = 21303296928817 is a prime.
It is not a weakly prime, because it can be changed into another prime (21303301123141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10651650561560 + 10651650561561.
It is an arithmetic number, because the mean of its divisors is an integer number (10651650561561).
Almost surely, 221303301123121 is an apocalyptic number.
It is an amenable number.
21303301123121 is a deficient number, since it is larger than the sum of its proper divisors (1).
21303301123121 is an equidigital number, since it uses as much as digits as its factorization.
21303301123121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 21303301123121 its reverse (12132110330312), we get a palindrome (33435411453433).
The spelling of 21303301123121 in words is "twenty-one trillion, three hundred three billion, three hundred one million, one hundred twenty-three thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •