Base | Representation |
---|---|
bin | 10010111010111111101101 |
3 | 100100000011111 |
4 | 102322333231 |
5 | 2232211422 |
6 | 254152021 |
7 | 60106222 |
oct | 22727755 |
9 | 10300144 |
10 | 4960237 |
11 | 2888777 |
12 | 17b2611 |
13 | 1048969 |
14 | 931949 |
15 | 67ea77 |
hex | 4bafed |
4960237 has 4 divisors (see below), whose sum is σ = 5016060. Its totient is φ = 4904416.
The previous prime is 4960231. The next prime is 4960259. The reversal of 4960237 is 7320694.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 7320694 = 2 ⋅3660347.
It can be written as a sum of positive squares in 2 ways, for example, as 2802276 + 2157961 = 1674^2 + 1469^2 .
It is a cyclic number.
It is not a de Polignac number, because 4960237 - 211 = 4958189 is a prime.
It is a d-powerful number, because it can be written as 43 + 97 + 6 + 0 + 2 + 311 + 72 .
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 4960199 and 4960208.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4960231) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 27778 + ... + 27955.
It is an arithmetic number, because the mean of its divisors is an integer number (1254015).
Almost surely, 24960237 is an apocalyptic number.
It is an amenable number.
4960237 is a deficient number, since it is larger than the sum of its proper divisors (55823).
4960237 is an equidigital number, since it uses as much as digits as its factorization.
4960237 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 55822.
The product of its (nonzero) digits is 9072, while the sum is 31.
The square root of 4960237 is about 2227.1589525671. The cubic root of 4960237 is about 170.5430958905.
The spelling of 4960237 in words is "four million, nine hundred sixty thousand, two hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •