Base | Representation |
---|---|
bin | 11000110010101100… |
… | …01000001101101111 |
3 | 1021100121100211002201 |
4 | 30121112020031233 |
5 | 204224343224403 |
6 | 10040430202331 |
7 | 650560156531 |
oct | 143126101557 |
9 | 37317324081 |
10 | 13310133103 |
11 | 5710250003 |
12 | 26b56533a7 |
13 | 1341709b07 |
14 | 903a19851 |
15 | 52d7b321d |
hex | 31958836f |
13310133103 has 4 divisors (see below), whose sum is σ = 13769103240. Its totient is φ = 12851162968.
The previous prime is 13310133071. The next prime is 13310133139. The reversal of 13310133103 is 30133101331.
It is a happy number.
13310133103 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 13310133103 - 25 = 13310133071 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13310131103) 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, 229485025 + ... + 229485082.
It is an arithmetic number, because the mean of its divisors is an integer number (3442275810).
Almost surely, 213310133103 is an apocalyptic number.
13310133103 is a deficient number, since it is larger than the sum of its proper divisors (458970137).
13310133103 is an equidigital number, since it uses as much as digits as its factorization.
13310133103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 458970136.
The product of its (nonzero) digits is 243, while the sum is 19.
Adding to 13310133103 its reverse (30133101331), we get a palindrome (43443234434).
The spelling of 13310133103 in words is "thirteen billion, three hundred ten million, one hundred thirty-three thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •