Base | Representation |
---|---|
bin | 10011001101100010001… |
… | …011000010010100000111 |
3 | 11200012200011000101221221 |
4 | 103031202023002110013 |
5 | 133112233204120403 |
6 | 2450254211021211 |
7 | 164244560005231 |
oct | 23154213022407 |
9 | 4605604011857 |
10 | 1320202020103 |
11 | 46999269397a |
12 | 193a44b9a807 |
13 | 976575b59a5 |
14 | 47c8061b251 |
15 | 2451c798dbd |
hex | 133622c2507 |
1320202020103 has 4 divisors (see below), whose sum is σ = 1397860962480. Its totient is φ = 1242543077728.
The previous prime is 1320202020097. The next prime is 1320202020133. The reversal of 1320202020103 is 3010202020231.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1320202020103 - 237 = 1182763066631 is a prime.
It is a super-2 number, since 2×13202020201032 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1320202020133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 38829471163 + ... + 38829471196.
It is an arithmetic number, because the mean of its divisors is an integer number (349465240620).
Almost surely, 21320202020103 is an apocalyptic number.
1320202020103 is a deficient number, since it is larger than the sum of its proper divisors (77658942377).
1320202020103 is an equidigital number, since it uses as much as digits as its factorization.
1320202020103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 77658942376.
The product of its (nonzero) digits is 144, while the sum is 16.
Adding to 1320202020103 its reverse (3010202020231), we get a palindrome (4330404040334).
The spelling of 1320202020103 in words is "one trillion, three hundred twenty billion, two hundred two million, twenty thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •