Base | Representation |
---|---|
bin | 1001000011111001100… |
… | …10010110101000110101 |
3 | 1002202121012121122102201 |
4 | 10201330302112220311 |
5 | 20100101243020041 |
6 | 355005032304501 |
7 | 31331035464253 |
oct | 4417462265065 |
9 | 1082535548381 |
10 | 311331220021 |
11 | 1100423a2648 |
12 | 50408242131 |
13 | 23487565423 |
14 | 110d5dd15d3 |
15 | 8172377631 |
hex | 487cc96a35 |
311331220021 has 2 divisors, whose sum is σ = 311331220022. Its totient is φ = 311331220020.
The previous prime is 311331219973. The next prime is 311331220037. The reversal of 311331220021 is 120022133113.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 211035496996 + 100295723025 = 459386^2 + 316695^2 .
It is a cyclic number.
It is not a de Polignac number, because 311331220021 - 27 = 311331219893 is a prime.
It is a super-2 number, since 2×3113312200212 (a number of 24 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (315331220021) 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, 155665610010 + 155665610011.
It is an arithmetic number, because the mean of its divisors is an integer number (155665610011).
Almost surely, 2311331220021 is an apocalyptic number.
It is an amenable number.
311331220021 is a deficient number, since it is larger than the sum of its proper divisors (1).
311331220021 is an equidigital number, since it uses as much as digits as its factorization.
311331220021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 311331220021 its reverse (120022133113), we get a palindrome (431353353134).
The spelling of 311331220021 in words is "three hundred eleven billion, three hundred thirty-one million, two hundred twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •