Search a number
-
+
107092152 = 2333495797
BaseRepresentation
bin1100110001000…
…01100010111000
321110111211211000
412120201202320
5204403422102
614343205000
72440161006
oct630414270
9243454730
10107092152
11554a5a12
122ba46760
131925794b
1410319a76
15960601c
hex66218b8

107092152 has 32 divisors (see below), whose sum is σ = 297478800. Its totient is φ = 35697312.

The previous prime is 107092121. The next prime is 107092201. The reversal of 107092152 is 251290701.

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

It is a Harshad number since it is a multiple of its sum of digits (27).

It is a congruent number.

It is an unprimeable number.

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 7 ways as a sum of consecutive naturals, for example, 247683 + ... + 248114.

Almost surely, 2107092152 is an apocalyptic number.

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

It is an amenable number.

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

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

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

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

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

The product of its (nonzero) digits is 1260, while the sum is 27.

The square root of 107092152 is about 10348.5338091925. The cubic root of 107092152 is about 474.8821898042.

The spelling of 107092152 in words is "one hundred seven million, ninety-two thousand, one hundred fifty-two".

Divisors: 1 2 3 4 6 8 9 12 18 24 27 36 54 72 108 216 495797 991594 1487391 1983188 2974782 3966376 4462173 5949564 8924346 11899128 13386519 17848692 26773038 35697384 53546076 107092152