Base | Representation |
---|---|
bin | 1100000110010101101001… |
… | …1000101000011001110111 |
3 | 1202002202110001010201010011 |
4 | 3001211122120220121313 |
5 | 3220424101202401403 |
6 | 44143154435441051 |
7 | 2542053326214211 |
oct | 301453230503167 |
9 | 52082401121104 |
10 | 13303030122103 |
11 | 4269868770637 |
12 | 15aa271a56187 |
13 | 7566164b6c87 |
14 | 33dc277715b1 |
15 | 181097d89a6d |
hex | c195a628677 |
13303030122103 has 4 divisors (see below), whose sum is σ = 13398735374920. Its totient is φ = 13207324869288.
The previous prime is 13303030122077. The next prime is 13303030122113. The reversal of 13303030122103 is 30122103030331.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13303030122103 is a prime.
It is a super-2 number, since 2×133030301221032 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13303030122113) 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, 47852626200 + ... + 47852626477.
It is an arithmetic number, because the mean of its divisors is an integer number (3349683843730).
Almost surely, 213303030122103 is an apocalyptic number.
13303030122103 is a deficient number, since it is larger than the sum of its proper divisors (95705252817).
13303030122103 is an equidigital number, since it uses as much as digits as its factorization.
13303030122103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 95705252816.
The product of its (nonzero) digits is 972, while the sum is 22.
Adding to 13303030122103 its reverse (30122103030331), we get a palindrome (43425133152434).
The spelling of 13303030122103 in words is "thirteen trillion, three hundred three billion, thirty million, one hundred twenty-two thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •