Search a number
-
+
5000101415 = 51000020283
BaseRepresentation
bin1001010100000011…
…10111111000100111
3110220110120110200022
410222001313320213
540220011221130
62144053305355
7234623106101
oct45201677047
913813513608
105000101415
112136477221
12b7663525b
13618b95aba
143560ca571
151e3e767e5
hex12a077e27

5000101415 has 4 divisors (see below), whose sum is σ = 6000121704. Its totient is φ = 4000081128.

The previous prime is 5000101391. The next prime is 5000101423. The reversal of 5000101415 is 5141010005.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is not a de Polignac number, because 5000101415 - 28 = 5000101159 is a prime.

It is a Duffinian number.

It is a junction number, because it is equal to n+sod(n) for n = 5000101393 and 5000101402.

It is a congruent 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 3 ways as a sum of consecutive naturals, for example, 500010137 + ... + 500010146.

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

Almost surely, 25000101415 is an apocalyptic number.

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

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

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

The sum of its prime factors is 1000020288.

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

The square root of 5000101415 is about 70711.3952273606. The cubic root of 5000101415 is about 1709.9875077459.

The spelling of 5000101415 in words is "five billion, one hundred one thousand, four hundred fifteen".

Divisors: 1 5 1000020283 5000101415