Search a number
-
+
105136570 = 25711136541
BaseRepresentation
bin1100100010001…
…00000110111010
321022211111021001
412101010012322
5203403332240
614233235214
72414434420
oct621040672
9238744231
10105136570
115438a730
122b262b0a
1318a217b6
14dd6b110
15936b89a
hex64441ba

105136570 has 32 divisors (see below), whose sum is σ = 235944576. Its totient is φ = 32769600.

The previous prime is 105136553. The next prime is 105136579. The reversal of 105136570 is 75631501.

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

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

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 67501 + ... + 69040.

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

Almost surely, 2105136570 is an apocalyptic number.

105136570 is a gapful number since it is divisible by the number (10) formed by its first and last digit.

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

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

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

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

The sum of its prime factors is 136566.

The product of its (nonzero) digits is 3150, while the sum is 28.

The square root of 105136570 is about 10253.6125341267. The cubic root of 105136570 is about 471.9738476604.

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

Divisors: 1 2 5 7 10 11 14 22 35 55 70 77 110 154 385 770 136541 273082 682705 955787 1365410 1501951 1911574 3003902 4778935 7509755 9557870 10513657 15019510 21027314 52568285 105136570