Base | Representation |
---|---|
bin | 1011000110110010… |
… | …10111001001110001 |
3 | 120101112121102210202 |
4 | 11203121113021301 |
5 | 44202403410423 |
6 | 2423354204545 |
7 | 300520632116 |
oct | 54331271161 |
9 | 16345542722 |
10 | 5962560113 |
11 | 258a789734 |
12 | 11a4a23755 |
13 | 7403ba5a3 |
14 | 407c6490d |
15 | 24d6de728 |
hex | 163657271 |
5962560113 has 2 divisors, whose sum is σ = 5962560114. Its totient is φ = 5962560112.
The previous prime is 5962560091. The next prime is 5962560133. The reversal of 5962560113 is 3110652695.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5899468864 + 63091249 = 76808^2 + 7943^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5962560113 is a prime.
It is a super-2 number, since 2×59625601132 = 71104246202277145538, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (5962560133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2981280056 + 2981280057.
It is an arithmetic number, because the mean of its divisors is an integer number (2981280057).
Almost surely, 25962560113 is an apocalyptic number.
It is an amenable number.
5962560113 is a deficient number, since it is larger than the sum of its proper divisors (1).
5962560113 is an equidigital number, since it uses as much as digits as its factorization.
5962560113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48600, while the sum is 38.
The square root of 5962560113 is about 77217.6153024684. The cubic root of 5962560113 is about 1813.3331044963. Note that the first 3 decimals are identical.
The spelling of 5962560113 in words is "five billion, nine hundred sixty-two million, five hundred sixty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •