Base | Representation |
---|---|
bin | 1110100111100… |
… | …1110110000101 |
3 | 11021101012101221 |
4 | 3221321312011 |
5 | 111144111420 |
6 | 10030120341 |
7 | 1343116156 |
oct | 351716605 |
9 | 137335357 |
10 | 61316485 |
11 | 3167aa8a |
12 | 186500b1 |
13 | c91b259 |
14 | 820192d |
15 | 55b2caa |
hex | 3a79d85 |
61316485 has 4 divisors (see below), whose sum is σ = 73579788. Its totient is φ = 49053184.
The previous prime is 61316483. The next prime is 61316491. The reversal of 61316485 is 58461316.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 26718561 + 34597924 = 5169^2 + 5882^2 .
It is a cyclic number.
It is not a de Polignac number, because 61316485 - 21 = 61316483 is a prime.
It is a super-2 number, since 2×613164852 = 7519422665510450, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 61316485.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (61316483) 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, 6131644 + ... + 6131653.
It is an arithmetic number, because the mean of its divisors is an integer number (18394947).
Almost surely, 261316485 is an apocalyptic number.
It is an amenable number.
61316485 is a deficient number, since it is larger than the sum of its proper divisors (12263303).
61316485 is a wasteful number, since it uses less digits than its factorization.
61316485 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12263302.
The product of its digits is 17280, while the sum is 34.
The square root of 61316485 is about 7830.4843400648. The cubic root of 61316485 is about 394.3293324674.
The spelling of 61316485 in words is "sixty-one million, three hundred sixteen thousand, four hundred eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •