Search a number
-
+
1550521252 = 22755375759
BaseRepresentation
bin101110001101011…
…0001001110100100
311000001120122022001
41130122301032210
511133413140002
6413505015044
753265133060
oct13432611644
94001518261
101550521252
11726257625
12373324484
131b93009c7
14109cd4aa0
15911c8a87
hex5c6b13a4

1550521252 has 12 divisors (see below), whose sum is σ = 3101042560. Its totient is φ = 664509096.

The previous prime is 1550521213. The next prime is 1550521253. The reversal of 1550521252 is 2521250551.

1550521252 is an admirable number.

It is a Harshad number since it is a multiple of its sum of digits (28), and also a Moran number because the ratio is a prime number: 55375759 = 1550521252 / (1 + 5 + 5 + 0 + 5 + 2 + 1 + 2 + 5 + 2).

It is a self number, because there is not a number n which added to its sum of digits gives 1550521252.

It is not an unprimeable number, because it can be changed into a prime (1550521253) 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, 27687852 + ... + 27687907.

Almost surely, 21550521252 is an apocalyptic number.

It is an amenable number.

1550521252 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.

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

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

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

The product of its (nonzero) digits is 5000, while the sum is 28.

The square root of 1550521252 is about 39376.6587206177. The cubic root of 1550521252 is about 1157.4242422044.

The spelling of 1550521252 in words is "one billion, five hundred fifty million, five hundred twenty-one thousand, two hundred fifty-two".

Divisors: 1 2 4 7 14 28 55375759 110751518 221503036 387630313 775260626 1550521252