Search a number
-
+
11061110165561 = 509106541203969
BaseRepresentation
bin1010000011110101110110…
…0010101101000000111001
31110011102122210012201220122
42200331131202231000321
52422211123200244221
635305223122303025
72221065423053321
oct240753542550071
943142583181818
1011061110165561
113584a99364875
1212a78734b7a75
1362309ab80c31
142a3509652281
15142ad15eeeab
hexa0f5d8ad039

11061110165561 has 8 divisors (see below), whose sum is σ = 11082999587400. Its totient is φ = 11039221365760.

The previous prime is 11061110165551. The next prime is 11061110165603. The reversal of 11061110165561 is 16556101116011.

It can be written as a sum of positive squares in 4 ways, for example, as 657163150336 + 10403947015225 = 810656^2 + 3225515^2 .

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-11061110165561 is a prime.

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (11061110165551) 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, 54127385 + ... + 54331353.

It is an arithmetic number, because the mean of its divisors is an integer number (1385374948425).

Almost surely, 211061110165561 is an apocalyptic number.

It is an amenable number.

11061110165561 is a deficient number, since it is larger than the sum of its proper divisors (21889421839).

11061110165561 is a wasteful number, since it uses less digits than its factorization.

11061110165561 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 311019.

The product of its (nonzero) digits is 5400, while the sum is 35.

The spelling of 11061110165561 in words is "eleven trillion, sixty-one billion, one hundred ten million, one hundred sixty-five thousand, five hundred sixty-one".

Divisors: 1 509 106541 203969 54229369 103820221 21731061229 11061110165561