Base | Representation |
---|---|
bin | 11101111110111001101… |
… | …01100011101111110001 |
3 | 10122111010120012201122001 |
4 | 32333130311203233301 |
5 | 113334323231230223 |
6 | 2105133544414001 |
7 | 134300241212152 |
oct | 16773465435761 |
9 | 3574116181561 |
10 | 1030202211313 |
11 | 3679a7322310 |
12 | 1477b0777301 |
13 | 761bc5105b2 |
14 | 37c0d68b929 |
15 | 1bbe7ed49ad |
hex | efdcd63bf1 |
1030202211313 has 4 divisors (see below), whose sum is σ = 1123856957808. Its totient is φ = 936547464820.
The previous prime is 1030202211251. The next prime is 1030202211317. The reversal of 1030202211313 is 3131122020301.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 1030202211313 - 221 = 1030200114161 is a prime.
It is a super-2 number, since 2×10302022113132 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1030202211317) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 46827373231 + ... + 46827373252.
It is an arithmetic number, because the mean of its divisors is an integer number (280964239452).
Almost surely, 21030202211313 is an apocalyptic number.
It is an amenable number.
1030202211313 is a deficient number, since it is larger than the sum of its proper divisors (93654746495).
1030202211313 is an equidigital number, since it uses as much as digits as its factorization.
1030202211313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 93654746494.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 1030202211313 its reverse (3131122020301), we get a palindrome (4161324231614).
The spelling of 1030202211313 in words is "one trillion, thirty billion, two hundred two million, two hundred eleven thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •