The number 61147
61147 is a composite number with 4 divisors. Its prime factorisation is 47 × 1301. Divisors (4): 1, 47, 1301, 61147.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 61147: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 47 × 1301, the product of two primes.
- 2
61147 is composite. Its prime factorisation is
- 3
The divisors add up to 62496; without 61147 itself that is 1349, so 61147 is deficient (1349 is less than 61147). Euler's totient φ(61147) = 59800 numbers up to 61147 share no factor with it.
- 4
The digits of 61147 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 148 steps to reach 1.
LaTeX source of the formulas on this page
\[ 61147 = 47 \times 1301 \]
61147 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 62496 |
| Euler totient φ(n) | 59800 |
| Square | 3738955609 |
| Cube | 228625918623523 |
| Square root | 247.279194 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 148 |
| Scientific notation | 6.1147 × |
61147 in other forms
| Form | Value |
|---|---|
| In words | sixty-one thousand one hundred and forty-seven |
| Binary (base 2) | 1110111011011011 |
| Octal (base 8) | 167333 |
| Hexadecimal (base 16) | EEDB |
| Base 3 | 10002212201 |
| As time | 61147 seconds = 16 h 59 min 7 s |
Is 61147 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 1) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | A number is divisible by 7 if double the last digit and subtract it from the rest: the result is a multiple of 7. |
| 8 | No (remainder 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 7) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 61147 a prime number?
No. 61147 = 47 × 1301, so it is divisible by 47.
What are the factors of 61147?
1, 47, 1301, 61147.
What is 61147 in binary?
1110111011011011 (hexadecimal EEDB, octal 167333).
What is the square root of 61147?
About 247.2792.
Is 61147 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 61147?
61147 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 47 × 1301, the product of two primes.