Base | Representation |
---|---|
bin | 100011010111100100010000… |
… | …0010000001000111010110101 |
3 | 1111210112002011101002222121211 |
4 | 1012233020200100020322311 |
5 | 311234044302232021323 |
6 | 3021354213444041421 |
7 | 122346251405336125 |
oct | 10657104020107265 |
9 | 1453462141088554 |
10 | 311102202220213 |
11 | 90143780810138 |
12 | 2aa85836093271 |
13 | 10478a72666691 |
14 | 56b75d96c6c85 |
15 | 25e773775c70d |
hex | 11af220408eb5 |
311102202220213 has 2 divisors, whose sum is σ = 311102202220214. Its totient is φ = 311102202220212.
The previous prime is 311102202220189. The next prime is 311102202220219. The reversal of 311102202220213 is 312022202201113.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 166425015938724 + 144677186281489 = 12900582^2 + 12028183^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-311102202220213 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (311102202220219) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 155551101110106 + 155551101110107.
It is an arithmetic number, because the mean of its divisors is an integer number (155551101110107).
Almost surely, 2311102202220213 is an apocalyptic number.
It is an amenable number.
311102202220213 is a deficient number, since it is larger than the sum of its proper divisors (1).
311102202220213 is an equidigital number, since it uses as much as digits as its factorization.
311102202220213 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 311102202220213 its reverse (312022202201113), we get a palindrome (623124404421326).
The spelling of 311102202220213 in words is "three hundred eleven trillion, one hundred two billion, two hundred two million, two hundred twenty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •