Search a number
-
+
10661505101 = 132523120623
BaseRepresentation
bin10011110110111100…
…11010100001001101
31000112000111120112022
421323132122201031
5133313321130401
64521533015525
7525126204152
oct117336324115
930460446468
1010661505101
114581161645
1220966245a5
13100ba6c100
14731d5a229
15425ec971b
hex27b79a84d

10661505101 has 12 divisors (see below), whose sum is σ = 11566876608. Its totient is φ = 9822490704.

The previous prime is 10661505091. The next prime is 10661505133. The reversal of 10661505101 is 10150516601.

It is not a de Polignac number, because 10661505101 - 218 = 10661242957 is a prime.

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

It is a Duffinian number.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (10661505901) 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 11 ways as a sum of consecutive naturals, for example, 28076 + ... + 148698.

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

Almost surely, 210661505101 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 121172 (or 121159 counting only the distinct ones).

The product of its (nonzero) digits is 900, while the sum is 26.

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

Divisors: 1 13 169 523 6799 88387 120623 1568099 20385287 63085829 820115777 10661505101