103666032 has 30 divisors (see below), whose sum is σ = 290121312. Its totient is φ = 34555296.

The previous prime is 103666027. The next prime is 103666049. The reversal of 103666032 is 230666301.

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

It is a congruent number.

It is an unprimeable number.

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

Almost surely, 2^103666032 is an apocalyptic number.

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

It is an amenable number.

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

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

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

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

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

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

The square root of 103666032 is about 10181.6517324057. The cubic root of 103666032 is about 469.7630192061.

The spelling of 103666032 in words is "one hundred three million, six hundred sixty-six thousand, thirty-two".