Search a number
-
+
106412151 = 348617297
BaseRepresentation
bin1100101011110…
…11100001110111
321102020022000210
412111323201313
5204220142101
614320440503
72431326336
oct625734167
9242208023
10106412151
115508102a
122b779133
131907a291
14101bdd1d
15951e7d6
hex657b877

106412151 has 8 divisors (see below), whose sum is σ = 141931504. Its totient is φ = 70917120.

The previous prime is 106412149. The next prime is 106412161. The reversal of 106412151 is 151214601.

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 106412151 - 21 = 106412149 is a prime.

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

It is a Duffinian number.

It is a congruent number.

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

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

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

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

Almost surely, 2106412151 is an apocalyptic number.

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

106412151 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 12161.

The product of its (nonzero) digits is 240, while the sum is 21.

The square root of 106412151 is about 10315.6265442289. The cubic root of 106412151 is about 473.8749380755.

Adding to 106412151 its reverse (151214601), we get a palindrome (257626752).

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

Divisors: 1 3 4861 7297 14583 21891 35470717 106412151