Base | Representation |
---|---|
bin | 110100101000100011… |
… | …1101000000000111111 |
3 | 101210202021002011101221 |
4 | 1221101013220000333 |
5 | 3322441201244403 |
6 | 123531511214211 |
7 | 11110664011201 |
oct | 1512107500077 |
9 | 353667064357 |
10 | 113030103103 |
11 | 43a32601455 |
12 | 19aa5677367 |
13 | a8741c1318 |
14 | 56837c4771 |
15 | 2e18135dbd |
hex | 1a511e803f |
113030103103 has 4 divisors (see below), whose sum is σ = 115786934928. Its totient is φ = 110273271280.
The previous prime is 113030103097. The next prime is 113030103163. The reversal of 113030103103 is 301301030311.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 301301030311 = 16447 ⋅18319513.
It is a cyclic number.
It is not a de Polignac number, because 113030103103 - 213 = 113030094911 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 (113030103163) 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, 1378415851 + ... + 1378415932.
It is an arithmetic number, because the mean of its divisors is an integer number (28946733732).
Almost surely, 2113030103103 is an apocalyptic number.
113030103103 is a deficient number, since it is larger than the sum of its proper divisors (2756831825).
113030103103 is an equidigital number, since it uses as much as digits as its factorization.
113030103103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2756831824.
The product of its (nonzero) digits is 81, while the sum is 16.
Adding to 113030103103 its reverse (301301030311), we get a palindrome (414331133414).
The spelling of 113030103103 in words is "one hundred thirteen billion, thirty million, one hundred three thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •