Search a number
-
+
105674072 = 2373751001
BaseRepresentation
bin1100100110001…
…11010101011000
321100211210120112
412103013111120
5204023032242
614252543452
72422133450
oct623072530
9240753515
10105674072
1154717549
122b481b88
1318b7c34a
141006ad60
159425c82
hex64c7558

105674072 has 32 divisors (see below), whose sum is σ = 232569120. Its totient is φ = 44064000.

The previous prime is 105674053. The next prime is 105674077. The reversal of 105674072 is 270476501.

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

It is a congruent number.

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

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

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

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

Almost surely, 2105674072 is an apocalyptic number.

It is an amenable number.

105674072 is an abundant number, since it is smaller than the sum of its proper divisors (126895048).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

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

The product of its (nonzero) digits is 11760, while the sum is 32.

The square root of 105674072 is about 10279.7894920081. The cubic root of 105674072 is about 472.7767899448.

The spelling of 105674072 in words is "one hundred five million, six hundred seventy-four thousand, seventy-two".

Divisors: 1 2 4 7 8 14 28 37 56 74 148 259 296 518 1036 2072 51001 102002 204004 357007 408008 714014 1428028 1887037 2856056 3774074 7548148 13209259 15096296 26418518 52837036 105674072