Base | Representation |
---|---|
bin | 1001100000010101… |
… | …10101101101101001 |
3 | 111011122102002220110 |
4 | 10300022311231221 |
5 | 40422344140423 |
6 | 2202213244533 |
7 | 240313522425 |
oct | 46012655551 |
9 | 14148362813 |
10 | 5103115113 |
11 | 2189636a08 |
12 | ba5033749 |
13 | 634323255 |
14 | 365a63b85 |
15 | 1ed024193 |
hex | 1302b5b69 |
5103115113 has 4 divisors (see below), whose sum is σ = 6804153488. Its totient is φ = 3402076740.
The previous prime is 5103115111. The next prime is 5103115141. The reversal of 5103115113 is 3115113015.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 5103115113 - 21 = 5103115111 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 5103115113.
It is not an unprimeable number, because it can be changed into a prime (5103115111) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 850519183 + ... + 850519188.
It is an arithmetic number, because the mean of its divisors is an integer number (1701038372).
Almost surely, 25103115113 is an apocalyptic number.
It is an amenable number.
5103115113 is a deficient number, since it is larger than the sum of its proper divisors (1701038375).
5103115113 is a wasteful number, since it uses less digits than its factorization.
5103115113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1701038374.
The product of its (nonzero) digits is 225, while the sum is 21.
The square root of 5103115113 is about 71436.0911094665. The cubic root of 5103115113 is about 1721.6510099150.
Adding to 5103115113 its reverse (3115113015), we get a palindrome (8218228128).
The spelling of 5103115113 in words is "five billion, one hundred three million, one hundred fifteen thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •