Search a number
-
+
10566601161 = 319031185077
BaseRepresentation
bin10011101011101000…
…11000100111001001
31000021101220221210120
421311310120213021
5133120022214121
64504302533453
7522564425244
oct116564304711
930241827716
1010566601161
114532630936
12206a897289
13cc51c102c
147234d425b
1541c9cebc6
hex275d189c9

10566601161 has 8 divisors (see below), whose sum is σ = 14089617984. Its totient is φ = 7043992560.

The previous prime is 10566601151. The next prime is 10566601163. The reversal of 10566601161 is 16110666501.

10566601161 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

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

It is not a de Polignac number, because 10566601161 - 210 = 10566600137 is a prime.

It is a super-2 number, since 2×105666011612 (a number of 21 digits) contains 22 as substring.

It is a Curzon number.

It is not an unprimeable number, because it can be changed into a prime (10566601163) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 35446 + ... + 149631.

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

Almost surely, 210566601161 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 204111.

The product of its (nonzero) digits is 6480, while the sum is 33.

The spelling of 10566601161 in words is "ten billion, five hundred sixty-six million, six hundred one thousand, one hundred sixty-one".

Divisors: 1 3 19031 57093 185077 555231 3522200387 10566601161