Base | Representation |
---|---|
bin | 1001100011110010101101… |
… | …00000001011010011101001 |
3 | 2202102120221010000122210001 |
4 | 10301321112200023103221 |
5 | 10223402022413101441 |
6 | 112412531314223001 |
7 | 4266501334144534 |
oct | 461712640132351 |
9 | 82376833018701 |
10 | 21021021222121 |
11 | 6774a68510278 |
12 | 2436021584a61 |
13 | b963736b4b3b |
14 | 5295cc45da1b |
15 | 266c11d3c731 |
hex | 131e5680b4e9 |
21021021222121 has 2 divisors, whose sum is σ = 21021021222122. Its totient is φ = 21021021222120.
The previous prime is 21021021222083. The next prime is 21021021222139. The reversal of 21021021222121 is 12122212012012.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 17656291359721 + 3364729862400 = 4201939^2 + 1834320^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-21021021222121 is a prime.
It is a super-2 number, since 2×210210212221212 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (21021021222191) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10510510611060 + 10510510611061.
It is an arithmetic number, because the mean of its divisors is an integer number (10510510611061).
Almost surely, 221021021222121 is an apocalyptic number.
It is an amenable number.
21021021222121 is a deficient number, since it is larger than the sum of its proper divisors (1).
21021021222121 is an equidigital number, since it uses as much as digits as its factorization.
21021021222121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 128, while the sum is 19.
Adding to 21021021222121 its reverse (12122212012012), we get a palindrome (33143233234133).
The spelling of 21021021222121 in words is "twenty-one trillion, twenty-one billion, twenty-one million, two hundred twenty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •