Search a number
-
+
5001050050 = 252496920129
BaseRepresentation
bin1001010100001010…
…11111011111000010
3110220112100122221221
410222011133133002
540220232100200
62144125505254
7234634136563
oct45205373702
913815318857
105001050050
112136a64a17
12b76a1222a
13619138819
1435629616a
151e40b291a
hex12a15f7c2

5001050050 has 24 divisors (see below), whose sum is σ = 9304287300. Its totient is φ = 1999918080.

The previous prime is 5001050017. The next prime is 5001050053. The reversal of 5001050050 is 500501005.

It can be written as a sum of positive squares in 6 ways, for example, as 2142116089 + 2858933961 = 46283^2 + 53469^2 .

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

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 11 ways as a sum of consecutive naturals, for example, 238386 + ... + 258514.

Almost surely, 25001050050 is an apocalyptic number.

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

5001050050 is a deficient number, since it is larger than the sum of its proper divisors (4303237250).

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

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

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

The product of its (nonzero) digits is 125, while the sum is 16.

The square root of 5001050050 is about 70718.1027036218. The cubic root of 5001050050 is about 1710.0956423142.

Adding to 5001050050 its reverse (500501005), we get a palindrome (5501551055).

The spelling of 5001050050 in words is "five billion, one million, fifty thousand, fifty".

Divisors: 1 2 5 10 25 50 4969 9938 20129 24845 40258 49690 100645 124225 201290 248450 503225 1006450 100021001 200042002 500105005 1000210010 2500525025 5001050050