Base | Representation |
---|---|
bin | 1110010011100… |
… | …0111101000001 |
3 | 11011220102102111 |
4 | 3210320331001 |
5 | 110330031423 |
6 | 5542015321 |
7 | 1326003163 |
oct | 344707501 |
9 | 134812374 |
10 | 60002113 |
11 | 30962526 |
12 | 18117541 |
13 | c57ac12 |
14 | 7d7c933 |
15 | 540360d |
hex | 3938f41 |
60002113 has 2 divisors, whose sum is σ = 60002114. Its totient is φ = 60002112.
The previous prime is 60002023. The next prime is 60002119. The reversal of 60002113 is 31120006.
60002113 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 51667344 + 8334769 = 7188^2 + 2887^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-60002113 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 60002093 and 60002102.
It is not a weakly prime, because it can be changed into another prime (60002119) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 30001056 + 30001057.
It is an arithmetic number, because the mean of its divisors is an integer number (30001057).
Almost surely, 260002113 is an apocalyptic number.
It is an amenable number.
60002113 is a deficient number, since it is larger than the sum of its proper divisors (1).
60002113 is an equidigital number, since it uses as much as digits as its factorization.
60002113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36, while the sum is 13.
The square root of 60002113 is about 7746.1030847775. The cubic root of 60002113 is about 391.4913596826.
Adding to 60002113 its reverse (31120006), we get a palindrome (91122119).
The spelling of 60002113 in words is "sixty million, two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •