Search a number
-
+
5050110005 = 54831209071
BaseRepresentation
bin1001011010000001…
…01001000000110101
3111000221200011120022
410231000221000311
540320312010010
62153041214525
7236101140533
oct45500510065
914027604508
105050110005
112161723436
12b8b331445
13626355095
1435c9c7153
151e8553d55
hex12d029035

5050110005 has 8 divisors (see below), whose sum is σ = 6061415424. Its totient is φ = 4039232400.

The previous prime is 5050109969. The next prime is 5050110011. The reversal of 5050110005 is 5000110505.

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 5050110005 - 216 = 5050044469 is a prime.

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

It is a Duffinian number.

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 80381 + ... + 128690.

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

Almost surely, 25050110005 is an apocalyptic number.

It is an amenable number.

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

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

5050110005 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 213907.

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

The square root of 5050110005 is about 71064.1260060236. The cubic root of 5050110005 is about 1715.6694290128.

It can be divided in two parts, 50501 and 10005, that multiplied together give a palindrome (505262505).

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

Divisors: 1 5 4831 24155 209071 1045355 1010022001 5050110005