Base | Representation |
---|---|
bin | 1001100001100001… |
… | …11110101000011011 |
3 | 111012100020001120211 |
4 | 10300300332220123 |
5 | 40432424104430 |
6 | 2203211431551 |
7 | 240464513215 |
oct | 46060765033 |
9 | 14170201524 |
10 | 5113113115 |
11 | 2194245620 |
12 | ba84555b7 |
13 | 636413c26 |
14 | 3671075b5 |
15 | 1edd4b72a |
hex | 130c3ea1b |
5113113115 has 8 divisors (see below), whose sum is σ = 6693529968. Its totient is φ = 3718627680.
The previous prime is 5113113113. The next prime is 5113113119.
5113113115 is nontrivially palindromic in base 10.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 5113113115 - 21 = 5113113113 is a prime.
It is a super-2 number, since 2×51131131152 = 52287851453570006450, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5113113113) 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, 46482792 + ... + 46482901.
It is an arithmetic number, because the mean of its divisors is an integer number (836691246).
Almost surely, 25113113115 is an apocalyptic number.
5113113115 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
5113113115 is a deficient number, since it is larger than the sum of its proper divisors (1580416853).
5113113115 is a wasteful number, since it uses less digits than its factorization.
5113113115 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 92965709.
The product of its digits is 225, while the sum is 22.
The square root of 5113113115 is about 71506.0355144935. The cubic root of 5113113115 is about 1722.7746269489.
It can be divided in two parts, 51131 and 13115, that added together give a palindrome (64246).
The spelling of 5113113115 in words is "five billion, one hundred thirteen million, one hundred thirteen thousand, one hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.174 sec. • engine limits •