Search a number
-
+
1550170132 = 22755363219
BaseRepresentation
bin101110001100101…
…1011100000010100
311000000220210122121
41130121123200110
511133320421012
6413453305324
753262141310
oct13431334024
94000823577
101550170132
11726037845
12373195244
131b9209c44
14109c42b40
1591159a07
hex5c65b814

1550170132 has 12 divisors (see below), whose sum is σ = 3100340320. Its totient is φ = 664358616.

The previous prime is 1550170091. The next prime is 1550170183. The reversal of 1550170132 is 2310710551.

1550170132 is an admirable number.

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

It is a congruent number.

It is an unprimeable number.

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

Almost surely, 21550170132 is an apocalyptic number.

It is an amenable number.

1550170132 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.

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

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

1550170132 is an evil number, because the sum of its binary digits is even.

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

The product of its (nonzero) digits is 1050, while the sum is 25.

The square root of 1550170132 is about 39372.1999893326. The cubic root of 1550170132 is about 1157.3368682584.

Adding to 1550170132 its reverse (2310710551), we get a palindrome (3860880683).

The spelling of 1550170132 in words is "one billion, five hundred fifty million, one hundred seventy thousand, one hundred thirty-two".

Divisors: 1 2 4 7 14 28 55363219 110726438 221452876 387542533 775085066 1550170132