Base | Representation |
---|---|
bin | 1001100110011100010110… |
… | …10010101110100011001001 |
3 | 2202202022000122002000221122 |
4 | 10303032023102232203021 |
5 | 10231400040401431441 |
6 | 112522433154245025 |
7 | 4306204356203036 |
oct | 463161322564311 |
9 | 82668018060848 |
10 | 21112101202121 |
11 | 67aa656812316 |
12 | 244b7bbb86775 |
13 | ba1b2a198527 |
14 | 52db8c96838d |
15 | 269292de834b |
hex | 13338b4ae8c9 |
21112101202121 has 2 divisors, whose sum is σ = 21112101202122. Its totient is φ = 21112101202120.
The previous prime is 21112101202009. The next prime is 21112101202169. The reversal of 21112101202121 is 12120210121112.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10982171812096 + 10129929390025 = 3313936^2 + 3182755^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-21112101202121 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 21112101202121.
It is not a weakly prime, because it can be changed into another prime (21112101202321) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10556050601060 + 10556050601061.
It is an arithmetic number, because the mean of its divisors is an integer number (10556050601061).
Almost surely, 221112101202121 is an apocalyptic number.
It is an amenable number.
21112101202121 is a deficient number, since it is larger than the sum of its proper divisors (1).
21112101202121 is an equidigital number, since it uses as much as digits as its factorization.
21112101202121 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 21112101202121 its reverse (12120210121112), we get a palindrome (33232311323233).
The spelling of 21112101202121 in words is "twenty-one trillion, one hundred twelve billion, one hundred one million, two hundred two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •