Search a number
-
+
5001110490 = 235179806099
BaseRepresentation
bin1001010100001011…
…01110001111011010
3110220112110201212110
410222011232033122
540220241013430
62144131053150
7234634511025
oct45205561732
913815421773
105001110490
112136aa6372
12b76a411b6
1361915a19c
143562b01bc
151e40c57b0
hex12a16e3da

5001110490 has 32 divisors (see below), whose sum is σ = 12708705600. Its totient is φ = 1255180544.

The previous prime is 5001110489. The next prime is 5001110531. The reversal of 5001110490 is 940111005.

It is a super-2 number, since 2×50011104902 = 50022212266376080200, which contains 22 as substring.

It is a Curzon number.

It is an unprimeable number.

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 15 ways as a sum of consecutive naturals, for example, 4902540 + ... + 4903559.

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

Almost surely, 25001110490 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 9806126.

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

The square root of 5001110490 is about 70718.5300327997. The cubic root of 5001110490 is about 1710.1025313850.

Adding to 5001110490 its reverse (940111005), we get a palindrome (5941221495).

The spelling of 5001110490 in words is "five billion, one million, one hundred ten thousand, four hundred ninety".

Divisors: 1 2 3 5 6 10 15 17 30 34 51 85 102 170 255 510 9806099 19612198 29418297 49030495 58836594 98060990 147091485 166703683 294182970 333407366 500111049 833518415 1000222098 1667036830 2500555245 5001110490