Base | Representation |
---|---|
bin | 1110101010010… |
… | …1111101001001 |
3 | 11021201101020122 |
4 | 3222211331021 |
5 | 111220402121 |
6 | 10034033025 |
7 | 1344501005 |
oct | 352457511 |
9 | 137641218 |
10 | 61497161 |
11 | 31793800 |
12 | 18718775 |
13 | c98256b |
14 | 824b705 |
15 | 55eb5ab |
hex | 3aa5f49 |
61497161 has 12 divisors (see below), whose sum is σ = 67823616. Its totient is φ = 55718520.
The previous prime is 61497157. The next prime is 61497187. The reversal of 61497161 is 16179416.
It is not a de Polignac number, because 61497161 - 22 = 61497157 is a prime.
It is a super-2 number, since 2×614971612 = 7563801622119842, which contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (61497151) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 45680 + ... + 47006.
It is an arithmetic number, because the mean of its divisors is an integer number (5651968).
Almost surely, 261497161 is an apocalyptic number.
It is an amenable number.
61497161 is a deficient number, since it is larger than the sum of its proper divisors (6326455).
61497161 is a wasteful number, since it uses less digits than its factorization.
61497161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1732 (or 1721 counting only the distinct ones).
The product of its digits is 9072, while the sum is 35.
The square root of 61497161 is about 7842.0125605612. The cubic root of 61497161 is about 394.7162647516.
The spelling of 61497161 in words is "sixty-one million, four hundred ninety-seven thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •