Base | Representation |
---|---|
bin | 1110101100001… |
… | …1001001000001 |
3 | 11021221110020012 |
4 | 3223003021001 |
5 | 111233213310 |
6 | 10040354305 |
7 | 1345506353 |
oct | 353031101 |
9 | 137843205 |
10 | 61616705 |
11 | 318655a7 |
12 | 18775995 |
13 | c9c4ab7 |
14 | 827d0d3 |
15 | 5621c05 |
hex | 3ac3241 |
61616705 has 8 divisors (see below), whose sum is σ = 74063592. Its totient is φ = 49211008.
The previous prime is 61616663. The next prime is 61616749. The reversal of 61616705 is 50761616.
It can be written as a sum of positive squares in 4 ways, for example, as 135424 + 61481281 = 368^2 + 7841^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 61616705 - 26 = 61616641 is a prime.
It is an alternating number because its digits alternate between even and odd.
It is a Duffinian number.
It is an unprimeable number.
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 in 7 ways as a sum of consecutive naturals, for example, 6902 + ... + 13071.
It is an arithmetic number, because the mean of its divisors is an integer number (9257949).
Almost surely, 261616705 is an apocalyptic number.
It is an amenable number.
61616705 is a deficient number, since it is larger than the sum of its proper divisors (12446887).
61616705 is a wasteful number, since it uses less digits than its factorization.
61616705 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20595.
The product of its (nonzero) digits is 7560, while the sum is 32.
The square root of 61616705 is about 7849.6308830416. The cubic root of 61616705 is about 394.9718614790.
It can be divided in two parts, 6161 and 6705, that multiplied together give a triangular number (41309505 = T9089).
The spelling of 61616705 in words is "sixty-one million, six hundred sixteen thousand, seven hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •