Search a number
-
+
166415132 = 22133200291
BaseRepresentation
bin10011110101101…
…00101100011100
3102121010202122102
421322310230130
5320100241012
624302504232
74060335212
oct1172645434
9377122572
10166415132
1185a34174
1247895078
13286286c0
141815ccb2
15e9232c2
hex9eb4b1c

166415132 has 12 divisors (see below), whose sum is σ = 313628616. Its totient is φ = 76806960.

The previous prime is 166415131. The next prime is 166415191. The reversal of 166415132 is 231514661.

It is a happy number.

It is a junction number, because it is equal to n+sod(n) for n = 166415095 and 166415104.

It is a congruent number.

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1600094 + ... + 1600197.

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

Almost surely, 2166415132 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The product of its digits is 4320, while the sum is 29.

The square root of 166415132 is about 12900.1989131951. The cubic root of 166415132 is about 550.0442190343.

Adding to 166415132 its reverse (231514661), we get a palindrome (397929793).

The spelling of 166415132 in words is "one hundred sixty-six million, four hundred fifteen thousand, one hundred thirty-two".

Divisors: 1 2 4 13 26 52 3200291 6400582 12801164 41603783 83207566 166415132