Search a number
-
+
106954150 = 2527927077
BaseRepresentation
bin1100101111111…
…11110110100110
321110020211111211
412113333312212
5204340013100
614340222034
72436044452
oct627776646
9243224454
10106954150
1155411266
122b99a91a
1319209ba4
14102c1662
1595ca1ba
hex65ffda6

106954150 has 24 divisors (see below), whose sum is σ = 201460320. Its totient is φ = 42238560.

The previous prime is 106954147. The next prime is 106954151. The reversal of 106954150 is 51459601.

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

It is a congruent number.

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

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

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 9589 + ... + 17488.

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

Almost surely, 2106954150 is an apocalyptic number.

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

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

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

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

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

The product of its (nonzero) digits is 5400, while the sum is 31.

The square root of 106954150 is about 10341.8639519189. The cubic root of 106954150 is about 474.6781198798.

The spelling of 106954150 in words is "one hundred six million, nine hundred fifty-four thousand, one hundred fifty".

Divisors: 1 2 5 10 25 50 79 158 395 790 1975 3950 27077 54154 135385 270770 676925 1353850 2139083 4278166 10695415 21390830 53477075 106954150