Base | Representation |
---|---|
bin | 1110100100110… |
… | …1110011001001 |
3 | 11021001000221000 |
4 | 3221031303021 |
5 | 111122323243 |
6 | 10022205213 |
7 | 1341435165 |
oct | 351156311 |
9 | 137030830 |
10 | 61136073 |
11 | 31567489 |
12 | 18583809 |
13 | c8870bb |
14 | 8195ca5 |
15 | 55795d3 |
hex | 3a4dcc9 |
61136073 has 8 divisors (see below), whose sum is σ = 90572000. Its totient is φ = 40757364.
The previous prime is 61136071. The next prime is 61136081. The reversal of 61136073 is 37063116.
It is not a de Polignac number, because 61136073 - 21 = 61136071 is a prime.
It is a super-2 number, since 2×611360732 = 7475238843722658, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27), and also a Moran number because the ratio is a prime number: 2264299 = 61136073 / (6 + 1 + 1 + 3 + 6 + 0 + 7 + 3).
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (61136071) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1132123 + ... + 1132176.
It is an arithmetic number, because the mean of its divisors is an integer number (11321500).
Almost surely, 261136073 is an apocalyptic number.
It is an amenable number.
61136073 is a deficient number, since it is larger than the sum of its proper divisors (29435927).
61136073 is a wasteful number, since it uses less digits than its factorization.
61136073 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2264308 (or 2264302 counting only the distinct ones).
The product of its (nonzero) digits is 2268, while the sum is 27.
The square root of 61136073 is about 7818.9560044804. The cubic root of 61136073 is about 393.9422063872.
Adding to 61136073 its reverse (37063116), we get a palindrome (98199189).
The spelling of 61136073 in words is "sixty-one million, one hundred thirty-six thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •