Base | Representation |
---|---|
bin | 1010000100001011000100… |
… | …0100111010001100011111 |
3 | 1110011222100210002000211002 |
4 | 2201002301010322030133 |
5 | 2422304304442434141 |
6 | 35312004253020515 |
7 | 2221356533036222 |
oct | 241026104721437 |
9 | 43158323060732 |
10 | 11066806608671 |
11 | 35874519018a0 |
12 | 12a89a318473b |
13 | 6237980a4c28 |
14 | 2a38ca0035b9 |
15 | 142d16774e9b |
hex | a10b113a31f |
11066806608671 has 4 divisors (see below), whose sum is σ = 12072879936744. Its totient is φ = 10060733280600.
The previous prime is 11066806608643. The next prime is 11066806608679. The reversal of 11066806608671 is 17680660866011.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 11066806608671 - 242 = 6668760097567 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11066806608679) 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 3 ways as a sum of consecutive naturals, for example, 503036664020 + ... + 503036664041.
It is an arithmetic number, because the mean of its divisors is an integer number (3018219984186).
Almost surely, 211066806608671 is an apocalyptic number.
11066806608671 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
11066806608671 is a deficient number, since it is larger than the sum of its proper divisors (1006073328073).
11066806608671 is a wasteful number, since it uses less digits than its factorization.
11066806608671 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1006073328072.
The product of its (nonzero) digits is 3483648, while the sum is 56.
The spelling of 11066806608671 in words is "eleven trillion, sixty-six billion, eight hundred six million, six hundred eight thousand, six hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •