Base | Representation |
---|---|
bin | 1011110000100101010… |
… | …1100100001111010001 |
3 | 201022110010110222020221 |
4 | 2330021111210033101 |
5 | 11302214122030223 |
6 | 232450132033041 |
7 | 20411150420236 |
oct | 2741125441721 |
9 | 638403428227 |
10 | 202020111313 |
11 | 787490a4789 |
12 | 331a0162781 |
13 | 160869b8507 |
14 | 9ac64d378d |
15 | 53c59aab5d |
hex | 2f095643d1 |
202020111313 has 2 divisors, whose sum is σ = 202020111314. Its totient is φ = 202020111312.
The previous prime is 202020111301. The next prime is 202020111331. The reversal of 202020111313 is 313111020202.
Together with next prime (202020111331) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 148092589584 + 53927521729 = 384828^2 + 232223^2 .
It is a cyclic number.
It is not a de Polignac number, because 202020111313 - 213 = 202020103121 is a prime.
It is a super-3 number, since 3×2020201113133 (a number of 35 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (202020111343) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 101010055656 + 101010055657.
It is an arithmetic number, because the mean of its divisors is an integer number (101010055657).
Almost surely, 2202020111313 is an apocalyptic number.
It is an amenable number.
202020111313 is a deficient number, since it is larger than the sum of its proper divisors (1).
202020111313 is an equidigital number, since it uses as much as digits as its factorization.
202020111313 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 202020111313 its reverse (313111020202), we get a palindrome (515131131515).
The spelling of 202020111313 in words is "two hundred two billion, twenty million, one hundred eleven thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •