Base | Representation |
---|---|
bin | 1010000100110100001101… |
… | …1100001001010101000111 |
3 | 1110020000212120010112112122 |
4 | 2201031003130021111013 |
5 | 2422444420114424403 |
6 | 35321032304240155 |
7 | 2222230334163404 |
oct | 241150334112507 |
9 | 43200776115478 |
10 | 11077852108103 |
11 | 35910aa797020 |
12 | 12aab6631005b |
13 | 624838570301 |
14 | 2a4256d592ab |
15 | 143261300838 |
hex | a1343709547 |
11077852108103 has 8 divisors (see below), whose sum is σ = 12085022127360. Its totient is φ = 10070697514680.
The previous prime is 11077852108097. The next prime is 11077852108109. The reversal of 11077852108103 is 30180125877011.
It is an interprime number because it is at equal distance from previous prime (11077852108097) and next prime (11077852108109).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11077852108103 - 230 = 11076778366279 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 (11077852108109) 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, 2328575 + ... + 5251472.
It is an arithmetic number, because the mean of its divisors is an integer number (1510627765920).
Almost surely, 211077852108103 is an apocalyptic number.
11077852108103 is a deficient number, since it is larger than the sum of its proper divisors (1007170019257).
11077852108103 is a wasteful number, since it uses less digits than its factorization.
11077852108103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7712917.
The product of its (nonzero) digits is 94080, while the sum is 44.
The spelling of 11077852108103 in words is "eleven trillion, seventy-seven billion, eight hundred fifty-two million, one hundred eight thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •