Base | Representation |
---|---|
bin | 11101101011111011111… |
… | …00010001011010011001 |
3 | 10121111211221222000110011 |
4 | 32311331330101122121 |
5 | 113203000132413423 |
6 | 2100331340521521 |
7 | 133460023440214 |
oct | 16657574213231 |
9 | 3544757860404 |
10 | 1020020201113 |
11 | 3636518a2351 |
12 | 14582a8502a1 |
13 | 75258bc72a4 |
14 | 375252aa77b |
15 | 1b7ee172b0d |
hex | ed7df11699 |
1020020201113 has 2 divisors, whose sum is σ = 1020020201114. Its totient is φ = 1020020201112.
The previous prime is 1020020201087. The next prime is 1020020201141. The reversal of 1020020201113 is 3111020200201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 880654618624 + 139365582489 = 938432^2 + 373317^2 .
It is an emirp because it is prime and its reverse (3111020200201) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1020020201113 - 221 = 1020018103961 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1020020201093 and 1020020201102.
It is not a weakly prime, because it can be changed into another prime (1020020201713) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 510010100556 + 510010100557.
It is an arithmetic number, because the mean of its divisors is an integer number (510010100557).
Almost surely, 21020020201113 is an apocalyptic number.
It is an amenable number.
1020020201113 is a deficient number, since it is larger than the sum of its proper divisors (1).
1020020201113 is an equidigital number, since it uses as much as digits as its factorization.
1020020201113 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 1020020201113 its reverse (3111020200201), we get a palindrome (4131040401314).
The spelling of 1020020201113 in words is "one trillion, twenty billion, twenty million, two hundred one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •