Base | Representation |
---|---|
bin | 1001100001100010… |
… | …00010111100001011 |
3 | 111012100020221210110 |
4 | 10300301002330023 |
5 | 40432430141023 |
6 | 2203212045403 |
7 | 240464615526 |
oct | 46061027413 |
9 | 14170227713 |
10 | 5113130763 |
11 | 2194257904 |
12 | ba8463863 |
13 | 63641bc80 |
14 | 36710dbbd |
15 | 1edd51a93 |
hex | 130c42f0b |
5113130763 has 8 divisors (see below), whose sum is σ = 7341931408. Its totient is φ = 3146541984.
The previous prime is 5113130761. The next prime is 5113130767. The reversal of 5113130763 is 3670313115.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 5113130763 - 21 = 5113130761 is a prime.
It is a super-2 number, since 2×51131307632 = 52288212399073924338, which contains 22 as substring.
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 5113130763.
It is not an unprimeable number, because it can be changed into a prime (5113130761) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 65552920 + ... + 65552997.
It is an arithmetic number, because the mean of its divisors is an integer number (917741426).
Almost surely, 25113130763 is an apocalyptic number.
5113130763 is a deficient number, since it is larger than the sum of its proper divisors (2228800645).
5113130763 is a wasteful number, since it uses less digits than its factorization.
5113130763 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 131105933.
The product of its (nonzero) digits is 5670, while the sum is 30.
The square root of 5113130763 is about 71506.1589165577. The cubic root of 5113130763 is about 1722.7766090090.
Adding to 5113130763 its reverse (3670313115), we get a palindrome (8783443878).
The spelling of 5113130763 in words is "five billion, one hundred thirteen million, one hundred thirty thousand, seven hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •