Base | Representation |
---|---|
bin | 1010000100110100101100… |
… | …0011011100001110101101 |
3 | 1110020001012110111110222212 |
4 | 2201031023003130032231 |
5 | 2423000200320142040 |
6 | 35321053110220205 |
7 | 2222233445026622 |
oct | 241151303341655 |
9 | 43201173443885 |
10 | 11077979849645 |
11 | 3591165906145 |
12 | 12aaba1054665 |
13 | 624858b77b17 |
14 | 2a4269ccc349 |
15 | 14326c634d65 |
hex | a134b0dc3ad |
11077979849645 has 8 divisors (see below), whose sum is σ = 13308232468704. Its totient is φ = 8852612780304.
The previous prime is 11077979849597. The next prime is 11077979849693. The reversal of 11077979849645 is 54694897977011.
It is an interprime number because it is at equal distance from previous prime (11077979849597) and next prime (11077979849693).
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 11077979849645 - 218 = 11077979587501 is a prime.
It is a super-3 number, since 3×110779798496453 (a number of 40 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1221382439 + ... + 1221391508.
It is an arithmetic number, because the mean of its divisors is an integer number (1663529058588).
Almost surely, 211077979849645 is an apocalyptic number.
It is an amenable number.
11077979849645 is a deficient number, since it is larger than the sum of its proper divisors (2230252619059).
11077979849645 is an equidigital number, since it uses as much as digits as its factorization.
11077979849645 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2442774859.
The product of its (nonzero) digits is 960180480, while the sum is 77.
The spelling of 11077979849645 in words is "eleven trillion, seventy-seven billion, nine hundred seventy-nine million, eight hundred forty-nine thousand, six hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •