Search a number
-
+
1550120000 = 26541113271
BaseRepresentation
bin101110001100100…
…1111010001000000
311000000211020212212
41130121033101000
511133312320000
6413452241252
753261542202
oct13431172100
94000736785
101550120000
11726003110
12373170228
131b91c0190
14109c2c772
1591149c35
hex5c64f440

1550120000 has 280 divisors, whose sum is σ = 4532449152. Its totient is φ = 518400000.

The previous prime is 1550119999. The next prime is 1550120003. The reversal of 1550120000 is 210551.

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

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 39 ways as a sum of consecutive naturals, for example, 5719865 + ... + 5720135.

Almost surely, 21550120000 is an apocalyptic number.

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

It is an amenable number.

It is a practical number, because each smaller number is the sum of distinct divisors of 1550120000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2266224576).

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

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

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

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

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

The product of its (nonzero) digits is 50, while the sum is 14.

The square root of 1550120000 is about 39371.5633420874. The cubic root of 1550120000 is about 1157.3243921575.

Adding to 1550120000 its reverse (210551), we get a palindrome (1550330551).

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