Base | Representation |
---|---|
bin | 1110100001010… |
… | …0001011001001 |
3 | 11020121001011002 |
4 | 3220110023021 |
5 | 111042300131 |
6 | 10013144345 |
7 | 1336433066 |
oct | 350241311 |
9 | 136531132 |
10 | 60900041 |
11 | 31416114 |
12 | 1848b0b5 |
13 | c803837 |
14 | 8133c6d |
15 | 552e6cb |
hex | 3a142c9 |
60900041 has 2 divisors, whose sum is σ = 60900042. Its totient is φ = 60900040.
The previous prime is 60899999. The next prime is 60900043. The reversal of 60900041 is 14000906.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 35940025 + 24960016 = 5995^2 + 4996^2 .
It is a cyclic number.
It is not a de Polignac number, because 60900041 - 210 = 60899017 is a prime.
It is a Sophie Germain prime.
Together with 60900043, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 60899986 and 60900022.
It is not a weakly prime, because it can be changed into another prime (60900043) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 30450020 + 30450021.
It is an arithmetic number, because the mean of its divisors is an integer number (30450021).
Almost surely, 260900041 is an apocalyptic number.
It is an amenable number.
60900041 is a deficient number, since it is larger than the sum of its proper divisors (1).
60900041 is an equidigital number, since it uses as much as digits as its factorization.
60900041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 20.
The square root of 60900041 is about 7803.8478329604. The cubic root of 60900041 is about 393.4345798126.
Adding to 60900041 its reverse (14000906), we get a palindrome (74900947).
The spelling of 60900041 in words is "sixty million, nine hundred thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •