Base | Representation |
---|---|
bin | 1100010010000111011… |
… | …0011000010111100101 |
3 | 202011200102210210111221 |
4 | 3010201312120113211 |
5 | 11424132423114341 |
6 | 240535234500341 |
7 | 21150206315353 |
oct | 3044166302745 |
9 | 664612723457 |
10 | 211021301221 |
11 | 81548028a05 |
12 | 34a927346b1 |
13 | 16b8c7942a3 |
14 | a2dbb387d3 |
15 | 5750d1eed1 |
hex | 3121d985e5 |
211021301221 has 2 divisors, whose sum is σ = 211021301222. Its totient is φ = 211021301220.
The previous prime is 211021301171. The next prime is 211021301233. The reversal of 211021301221 is 122103120112.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 210144312225 + 876988996 = 458415^2 + 29614^2 .
It is a cyclic number.
It is not a de Polignac number, because 211021301221 - 27 = 211021301093 is a prime.
It is a super-3 number, since 3×2110213012213 (a number of 35 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 211021301195 and 211021301204.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (211024301221) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105510650610 + 105510650611.
It is an arithmetic number, because the mean of its divisors is an integer number (105510650611).
Almost surely, 2211021301221 is an apocalyptic number.
It is an amenable number.
211021301221 is a deficient number, since it is larger than the sum of its proper divisors (1).
211021301221 is an equidigital number, since it uses as much as digits as its factorization.
211021301221 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 211021301221 its reverse (122103120112), we get a palindrome (333124421333).
The spelling of 211021301221 in words is "two hundred eleven billion, twenty-one million, three hundred one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •