The number 61451
61451 is a composite number with 8 divisors. Its prime factorisation is 13 × 29 × 163. Divisors (8): 1, 13, 29, 163, 377, 2119, 4727, 61451.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 61451: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
61451 is composite. Its prime factorisation is
- 3
The divisors add up to 68880; without 61451 itself that is 7429, so 61451 is deficient (7429 is less than 61451). Euler's totient φ(61451) = 54432 numbers up to 61451 share no factor with it.
- 4
The digits of 61451 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 179 steps to reach 1.
LaTeX source of the formulas on this page
\[ 61451 = 13 \times 29 \times 163 \]
61451 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 68880 |
| Euler totient φ(n) | 54432 |
| Square | 3776225401 |
| Cube | 232052827116851 |
| Square root | 247.893122 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 179 |
| Scientific notation | 6.1451 × |
61451 in other forms
| Form | Value |
|---|---|
| In words | sixty-one thousand four hundred and fifty-one |
| Binary (base 2) | 1111000000001011 |
| Octal (base 8) | 170013 |
| Hexadecimal (base 16) | F00B |
| Base 3 | 10010021222 |
| As time | 61451 seconds = 17 h 4 min 11 s |
Is 61451 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 2) | 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 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 61451 a prime number?
No. 61451 = 13 × 29 × 163, so it is divisible by 13.
What are the factors of 61451?
1, 13, 29, 163, 377, 2119, 4727, 61451.
What is 61451 in binary?
1111000000001011 (hexadecimal F00B, octal 170013).
What is the square root of 61451?
About 247.8931.
Is 61451 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 61451?
61451 is a happy number: repeatedly adding the squares of its digits reaches 1.