Search a number
171705132 = 22329749171
BaseRepresentation
bin10100011110000…
…00001100101100
3102222002112011100
422033000030230
5322424031012
625012123100
74153320024
oct1217001454
9388075140
10171705132
1188a17675
1249606490
132975b491
1418b38a84
151011a8dc
hexa3c032c

171705132 has 36 divisors (see below), whose sum is σ = 438515896. Its totient is φ = 56643840.

The previous prime is 171705059. The next prime is 171705133. The reversal of 171705132 is 231507171.

It is a happy number.

171705132 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.

It is a tau number, because it is divible by the number of its divisors (36).

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

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

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

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

Almost surely, 2171705132 is an apocalyptic number.

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

It is an amenable number.

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

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

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

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

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

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

The square root of 171705132 is about 13103.6304892957. The cubic root of 171705132 is about 555.8117947269.

The spelling of 171705132 in words is "one hundred seventy-one million, seven hundred five thousand, one hundred thirty-two".