Search a number
-
+
105601975 = 5225116829
BaseRepresentation
bin1100100101101…
…01101110110111
321100201010200021
412102311232313
5204013230400
614251230011
72421413323
oct622655667
9240633607
10105601975
1154678366
122b448307
1318b5559b
141004c983
15940e71a
hex64b5bb7

105601975 has 12 divisors (see below), whose sum is σ = 131475960. Its totient is φ = 84140000.

The previous prime is 105601973. The next prime is 105602009. The reversal of 105601975 is 579106501.

It is not a de Polignac number, because 105601975 - 21 = 105601973 is a prime.

It is a super-2 number, since 2×1056019752 = 22303554247801250, which contains 22 as substring.

It is a self number, because there is not a number n which added to its sum of digits gives 105601975.

It is a congruent number.

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

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

Almost surely, 2105601975 is an apocalyptic number.

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

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

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

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

The product of its (nonzero) digits is 9450, while the sum is 34.

The square root of 105601975 is about 10276.2821584462. The cubic root of 105601975 is about 472.6692468730.

The spelling of 105601975 in words is "one hundred five million, six hundred one thousand, nine hundred seventy-five".

Divisors: 1 5 25 251 1255 6275 16829 84145 420725 4224079 21120395 105601975