Base | Representation |
---|---|
bin | 1001100001100011… |
… | …10100011001011101 |
3 | 111012100122020200100 |
4 | 10300301310121131 |
5 | 40433003131331 |
6 | 2203220251313 |
7 | 240466421244 |
oct | 46061643135 |
9 | 14170566610 |
10 | 5113333341 |
11 | 2194386026 |
12 | ba8540b39 |
13 | 63649023c |
14 | 36716395b |
15 | 1edd91ae6 |
hex | 130c7465d |
5113333341 has 12 divisors (see below), whose sum is σ = 7387658460. Its totient is φ = 3408089280.
The previous prime is 5113333319. The next prime is 5113333361. The reversal of 5113333341 is 1433333115.
It can be written as a sum of positive squares in 2 ways, for example, as 760104900 + 4353228441 = 27570^2 + 65979^2 .
It is not a de Polignac number, because 5113333341 - 27 = 5113333213 is a prime.
It is a super-2 number, since 2×51133333412 = 52292355712364444562, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5113333301) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 24750 + ... + 104111.
It is an arithmetic number, because the mean of its divisors is an integer number (615638205).
Almost surely, 25113333341 is an apocalyptic number.
It is an amenable number.
5113333341 is a deficient number, since it is larger than the sum of its proper divisors (2274325119).
5113333341 is a wasteful number, since it uses less digits than its factorization.
5113333341 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 133276 (or 133273 counting only the distinct ones).
The product of its digits is 4860, while the sum is 27.
The square root of 5113333341 is about 71507.5754098823. The cubic root of 5113333341 is about 1722.7993603686.
Adding to 5113333341 its reverse (1433333115), we get a palindrome (6546666456).
The spelling of 5113333341 in words is "five billion, one hundred thirteen million, three hundred thirty-three thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •