Search a number
-
+
10605009561 = 36595364193
BaseRepresentation
bin10011110000001101…
…11001101010011001
31000101002012022012220
421320012321222121
5133204340301221
64512154054253
7523542044136
oct117006715231
930332168186
1010605009561
114552284713
12207b71a389
13100014b2b3
1472865158d
1542106a0c6
hex2781b9a99

10605009561 has 8 divisors (see below), whose sum is σ = 14161472160. Its totient is φ = 7059276672.

The previous prime is 10605009557. The next prime is 10605009563. The reversal of 10605009561 is 16590050601.

10605009561 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 10605009561 - 22 = 10605009557 is a prime.

It is a super-2 number, since 2×106050095612 (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 (10605009563) 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, 2680120 + ... + 2684073.

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

Almost surely, 210605009561 is an apocalyptic number.

It is an amenable number.

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

10605009561 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 5364855.

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

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

Divisors: 1 3 659 1977 5364193 16092579 3535003187 10605009561