Base | Representation |
---|---|
bin | 1001100001100010… |
… | …01001000000010001 |
3 | 111012100022012212101 |
4 | 10300301021000101 |
5 | 40432431434401 |
6 | 2203212400401 |
7 | 240465051121 |
oct | 46061110021 |
9 | 14170265771 |
10 | 5113155601 |
11 | 2194274534 |
12 | ba8476101 |
13 | 63642a378 |
14 | 367118c81 |
15 | 1edd59101 |
hex | 130c49011 |
5113155601 has 2 divisors, whose sum is σ = 5113155602. Its totient is φ = 5113155600.
The previous prime is 5113155589. The next prime is 5113155611. The reversal of 5113155601 is 1065513115.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4966866576 + 146289025 = 70476^2 + 12095^2 .
It is a cyclic number.
It is not a de Polignac number, because 5113155601 - 211 = 5113153553 is a prime.
It is a super-2 number, since 2×51131556012 = 52288720400075342402, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 5113155601.
It is not a weakly prime, because it can be changed into another prime (5113155611) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2556577800 + 2556577801.
It is an arithmetic number, because the mean of its divisors is an integer number (2556577801).
Almost surely, 25113155601 is an apocalyptic number.
It is an amenable number.
5113155601 is a deficient number, since it is larger than the sum of its proper divisors (1).
5113155601 is an equidigital number, since it uses as much as digits as its factorization.
5113155601 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2250, while the sum is 28.
The square root of 5113155601 is about 71506.3325936941. The cubic root of 5113155601 is about 1722.7793985756.
Adding to 5113155601 its reverse (1065513115), we get a palindrome (6178668716).
The spelling of 5113155601 in words is "five billion, one hundred thirteen million, one hundred fifty-five thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •