Search a number
-
+
106414157 = 47267719
BaseRepresentation
bin1100101011111…
…00000001001101
321102020101210002
412111330001031
5204220223112
614320454045
72431335233
oct625740115
9242211702
10106414157
1155082593
122b77a325
131907b175
14101c0953
1595201c2
hex657c04d

106414157 has 12 divisors (see below), whose sum is σ = 110502720. Its totient is φ = 102452856.

The previous prime is 106414151. The next prime is 106414171. The reversal of 106414157 is 751414601.

It is not a de Polignac number, because 106414157 - 26 = 106414093 is a prime.

It is a super-2 number, since 2×1064141572 = 22647945620041298, 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 (106414151) by changing a digit.

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

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

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

Almost surely, 2106414157 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The product of its (nonzero) digits is 3360, while the sum is 29.

The square root of 106414157 is about 10315.7237748982. The cubic root of 106414157 is about 473.8779157654.

Adding to 106414157 its reverse (751414601), we get a palindrome (857828758).

The spelling of 106414157 in words is "one hundred six million, four hundred fourteen thousand, one hundred fifty-seven".

Divisors: 1 47 67 719 2209 3149 33793 48173 148003 1588271 2264131 106414157