Base | Representation |
---|---|
bin | 100000111000000… |
… | …0100011010001101 |
3 | 2211212201022011210 |
4 | 1001300010122031 |
5 | 4224344320023 |
6 | 301243405033 |
7 | 36223236222 |
oct | 10160043215 |
9 | 2755638153 |
10 | 1103120013 |
11 | 516756436 |
12 | 269523779 |
13 | 147703b48 |
14 | a6711949 |
15 | 66ca0593 |
hex | 41c0468d |
1103120013 has 8 divisors (see below), whose sum is σ = 1471551328. Its totient is φ = 735051024.
The previous prime is 1103119999. The next prime is 1103120063. The reversal of 1103120013 is 3100213011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1103120013 - 26 = 1103119949 is a prime.
It is a super-2 number, since 2×11031200132 = 2433747526162240338, which 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 (1103120063) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 83395 + ... + 95712.
It is an arithmetic number, because the mean of its divisors is an integer number (183943916).
Almost surely, 21103120013 is an apocalyptic number.
It is an amenable number.
1103120013 is a deficient number, since it is larger than the sum of its proper divisors (368431315).
1103120013 is a wasteful number, since it uses less digits than its factorization.
1103120013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 181163.
The product of its (nonzero) digits is 18, while the sum is 12.
The square root of 1103120013 is about 33213.2505635928. The cubic root of 1103120013 is about 1033.2551721549.
Adding to 1103120013 its reverse (3100213011), we get a palindrome (4203333024).
The spelling of 1103120013 in words is "one billion, one hundred three million, one hundred twenty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •