Base | Representation |
---|---|
bin | 100000011101110011110… |
… | …100101100011100110101 |
3 | 21220021200101211211202201 |
4 | 200131303310230130311 |
5 | 243023122443020041 |
6 | 4424531021504501 |
7 | 320121014321212 |
oct | 40356364543465 |
9 | 7807611754681 |
10 | 2231031220021 |
11 | 7901a1a6296a |
12 | 30047ba12131 |
13 | 132501796ba6 |
14 | 79da7d32b09 |
15 | 3d07a877631 |
hex | 20773d2c735 |
2231031220021 has 2 divisors, whose sum is σ = 2231031220022. Its totient is φ = 2231031220020.
The previous prime is 2231031219973. The next prime is 2231031220037. The reversal of 2231031220021 is 1200221301322.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1766706180625 + 464325039396 = 1329175^2 + 681414^2 .
It is a cyclic number.
It is not a de Polignac number, because 2231031220021 - 221 = 2231029122869 is a prime.
It is a super-3 number, since 3×22310312200213 (a number of 38 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2231031220321) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1115515610010 + 1115515610011.
It is an arithmetic number, because the mean of its divisors is an integer number (1115515610011).
Almost surely, 22231031220021 is an apocalyptic number.
It is an amenable number.
2231031220021 is a deficient number, since it is larger than the sum of its proper divisors (1).
2231031220021 is an equidigital number, since it uses as much as digits as its factorization.
2231031220021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 2231031220021 its reverse (1200221301322), we get a palindrome (3431252521343).
The spelling of 2231031220021 in words is "two trillion, two hundred thirty-one billion, thirty-one million, two hundred twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •