Base | Representation |
---|---|
bin | 11101111110111001101… |
… | …01100011101100101001 |
3 | 10122111010120012201100122 |
4 | 32333130311203230221 |
5 | 113334323231223423 |
6 | 2105133544413025 |
7 | 134300241211445 |
oct | 16773465435451 |
9 | 3574116181318 |
10 | 1030202211113 |
11 | 3679a7322149 |
12 | 1477b0777175 |
13 | 761bc51048a |
14 | 37c0d68b825 |
15 | 1bbe7ed48c8 |
hex | efdcd63b29 |
1030202211113 has 2 divisors, whose sum is σ = 1030202211114. Its totient is φ = 1030202211112.
The previous prime is 1030202211091. The next prime is 1030202211167. The reversal of 1030202211113 is 3111122020301.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 859130633449 + 171071577664 = 926893^2 + 413608^2 .
It is a cyclic number.
It is not a de Polignac number, because 1030202211113 - 28 = 1030202210857 is a prime.
It is a super-2 number, since 2×10302022111132 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1030202211091 and 1030202211100.
It is not a weakly prime, because it can be changed into another prime (1030202211413) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 515101105556 + 515101105557.
It is an arithmetic number, because the mean of its divisors is an integer number (515101105557).
Almost surely, 21030202211113 is an apocalyptic number.
It is an amenable number.
1030202211113 is a deficient number, since it is larger than the sum of its proper divisors (1).
1030202211113 is an equidigital number, since it uses as much as digits as its factorization.
1030202211113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 1030202211113 its reverse (3111122020301), we get a palindrome (4141324231414).
The spelling of 1030202211113 in words is "one trillion, thirty billion, two hundred two million, two hundred eleven thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •