Search a number
-
+
105649152 = 21037173
BaseRepresentation
bin1100100110000…
…01010000000000
321100210112101120
412103001100000
5204021233102
614252232240
72422001010
oct623012000
9240715346
10105649152
11546aa854
122b46b680
1318b70bbb
1410061c40
15941d6bc
hex64c1400

105649152 has 176 divisors, whose sum is σ = 341930880. Its totient is φ = 28409856.

The previous prime is 105649121. The next prime is 105649153. The reversal of 105649152 is 251946501.

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

It is a congruent number.

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

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

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

Almost surely, 2105649152 is an apocalyptic number.

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

It is an amenable number.

It is a practical number, because each smaller number is the sum of distinct divisors of 105649152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (170965440).

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

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

105649152 is an frugal number, since it uses more digits than its factorization.

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

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

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

The square root of 105649152 is about 10278.5773334640. The cubic root of 105649152 is about 472.7396237046.

The spelling of 105649152 in words is "one hundred five million, six hundred forty-nine thousand, one hundred fifty-two".