Base | Representation |
---|---|
bin | 1001100000100100… |
… | …00001111111011111 |
3 | 111011202221220001110 |
4 | 10300102001333133 |
5 | 40423340003130 |
6 | 2202321513103 |
7 | 240335534064 |
oct | 46022017737 |
9 | 14152856043 |
10 | 5105000415 |
11 | 218a704409 |
12 | ba57a2793 |
13 | 634833408 |
14 | 365dd4c6b |
15 | 1ed297ab0 |
hex | 130481fdf |
5105000415 has 8 divisors (see below), whose sum is σ = 8168000688. Its totient is φ = 2722666880.
The previous prime is 5105000401. The next prime is 5105000419. The reversal of 5105000415 is 5140005015.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 5105000415 - 24 = 5105000399 is a prime.
It is a super-2 number, since 2×51050004152 = 52122058474300344450, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5105000391 and 5105000400.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5105000419) 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 7 ways as a sum of consecutive naturals, for example, 170166666 + ... + 170166695.
It is an arithmetic number, because the mean of its divisors is an integer number (1021000086).
Almost surely, 25105000415 is an apocalyptic number.
5105000415 is a deficient number, since it is larger than the sum of its proper divisors (3063000273).
5105000415 is a wasteful number, since it uses less digits than its factorization.
5105000415 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 340333369.
The product of its (nonzero) digits is 500, while the sum is 21.
The square root of 5105000415 is about 71449.2856157429. The cubic root of 5105000415 is about 1721.8630001985.
The spelling of 5105000415 in words is "five billion, one hundred five million, four hundred fifteen", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •