Base | Representation |
---|---|
bin | 110000000110100111… |
… | …0110011110011011001 |
3 | 100212122020102201211121 |
4 | 1200031032303303121 |
5 | 3143030101413423 |
6 | 115242251125241 |
7 | 10314620502355 |
oct | 1401516636331 |
9 | 325566381747 |
10 | 103301201113 |
11 | 3a89a920390 |
12 | 1802b443821 |
13 | 9983722696 |
14 | 4ddd670465 |
15 | 2a48e7845d |
hex | 180d3b3cd9 |
103301201113 has 8 divisors (see below), whose sum is σ = 112712229216. Its totient is φ = 93893508000.
The previous prime is 103301201111. The next prime is 103301201119. The reversal of 103301201113 is 311102103301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 103301201113 - 21 = 103301201111 is a prime.
It is a super-2 number, since 2×1033012011132 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (103301201111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 768756 + ... + 893077.
It is an arithmetic number, because the mean of its divisors is an integer number (14089028652).
Almost surely, 2103301201113 is an apocalyptic number.
It is an amenable number.
103301201113 is a deficient number, since it is larger than the sum of its proper divisors (9411028103).
103301201113 is a wasteful number, since it uses less digits than its factorization.
103301201113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1667495.
The product of its (nonzero) digits is 54, while the sum is 16.
Adding to 103301201113 its reverse (311102103301), we get a palindrome (414403304414).
The spelling of 103301201113 in words is "one hundred three billion, three hundred one million, two hundred one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •