Search a number
-
+
164952750 = 2353219937
BaseRepresentation
bin10011101010011…
…11101010101110
3102111101110122010
421311033222232
5314211442000
624211302050
74042034544
oct1165175256
9374343563
10164952750
1185125496
12472aa926
1328235ba1
1417c9bd94
15e734d50
hex9d4faae

164952750 has 32 divisors (see below), whose sum is σ = 411723936. Its totient is φ = 43987200.

The previous prime is 164952743. The next prime is 164952761. The reversal of 164952750 is 57259461.

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

It is a congruent number.

It is an unprimeable number.

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 15 ways as a sum of consecutive naturals, for example, 109219 + ... + 110718.

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

Almost surely, 2164952750 is an apocalyptic number.

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

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

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

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

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

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

The product of its (nonzero) digits is 75600, while the sum is 39.

The square root of 164952750 is about 12843.3932432204. The cubic root of 164952750 is about 548.4282952733.

The spelling of 164952750 in words is "one hundred sixty-four million, nine hundred fifty-two thousand, seven hundred fifty".

Divisors: 1 2 3 5 6 10 15 25 30 50 75 125 150 250 375 750 219937 439874 659811 1099685 1319622 2199370 3299055 5498425 6598110 10996850 16495275 27492125 32990550 54984250 82476375 164952750