Search a number
-
+
5055015000 = 233547311553
BaseRepresentation
bin1001011010100110…
…10110100001011000
3111001021220100221210
410231103112201120
540323040440000
62153334303120
7236160630030
oct45523264130
914037810853
105055015000
112164473652
12b90ab7aa0
13627381849
1435d5028c0
151e8bc2350
hex12d4d6858

5055015000 has 320 divisors, whose sum is σ = 18642032640. Its totient is φ = 1117440000.

The previous prime is 5055014989. The next prime is 5055015001. The reversal of 5055015000 is 5105505.

It is a Harshad number since it is a multiple of its sum of digits (21).

It is a congruent number.

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

It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 3254224 + ... + 3255776.

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

Almost surely, 25055015000 is an apocalyptic number.

5055015000 is a gapful number since it is divisible by the number (50) 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 5055015000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (9321016320).

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

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

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

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

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

The product of its (nonzero) digits is 625, while the sum is 21.

The square root of 5055015000 is about 71098.6286787586. The cubic root of 5055015000 is about 1716.2247058233.

The spelling of 5055015000 in words is "five billion, fifty-five million, fifteen thousand".