Base | Representation |
---|---|
bin | 1010000110010011000001… |
… | …1100110010011011001111 |
3 | 1110022110120022001201020212 |
4 | 2201210300130302123033 |
5 | 2423404031122004403 |
6 | 35340442004033035 |
7 | 2224121130643301 |
oct | 241446034623317 |
9 | 43273508051225 |
10 | 11103303313103 |
11 | 35a0980292041 |
12 | 12b3a8999277b |
13 | 627063405b21 |
14 | 2a558d1d5971 |
15 | 143c508ed4d8 |
hex | a19307326cf |
11103303313103 has 8 divisors (see below), whose sum is σ = 11587720222176. Its totient is φ = 10619025120000.
The previous prime is 11103303313099. The next prime is 11103303313133. The reversal of 11103303313103 is 30131330330111.
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 11103303313103 - 22 = 11103303313099 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11103303313133) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 34515398 + ... + 34835603.
It is an arithmetic number, because the mean of its divisors is an integer number (1448465027772).
Almost surely, 211103303313103 is an apocalyptic number.
11103303313103 is a deficient number, since it is larger than the sum of its proper divisors (484416909073).
11103303313103 is an equidigital number, since it uses as much as digits as its factorization.
11103303313103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 69357985.
The product of its (nonzero) digits is 729, while the sum is 23.
Adding to 11103303313103 its reverse (30131330330111), we get a palindrome (41234633643214).
The spelling of 11103303313103 in words is "eleven trillion, one hundred three billion, three hundred three million, three hundred thirteen thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •