The number 98447
98447 is a composite number with 4 divisors. Its prime factorisation is 17 × 5791. Divisors (4): 1, 17, 5791, 98447.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 98447: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 17 × 5791, the product of two primes.
- 2
98447 is composite. Its prime factorisation is
- 3
The divisors add up to 104256; without 98447 itself that is 5809, so 98447 is deficient (5809 is less than 98447). Euler's totient φ(98447) = 92640 numbers up to 98447 share no factor with it.
- 4
The digits of 98447 add up to 32, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 146 steps to reach 1.
LaTeX source of the formulas on this page
\[ 98447 = 17 \times 5791 \]
98447 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 104256 |
| Euler totient φ(n) | 92640 |
| Square | 9691811809 |
| Cube | 954129797160623 |
| Square root | 313.762649 |
| Digit sum / digital root | 32 / 5 |
| Collatz steps to 1 | 146 |
| Scientific notation | 9.8447 × |
98447 in other forms
| Form | Value |
|---|---|
| In words | ninety-eight thousand four hundred and forty-seven |
| Binary (base 2) | 11000000010001111 |
| Octal (base 8) | 300217 |
| Hexadecimal (base 16) | 1808F |
| Base 3 | 12000001012 |
| As time | 98447 seconds = 27 h 20 min 47 s |
Is 98447 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 2) | 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 6) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | 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 8) | 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 98447 a prime number?
No. 98447 = 17 × 5791, so it is divisible by 17.
What are the factors of 98447?
1, 17, 5791, 98447.
What is 98447 in binary?
11000000010001111 (hexadecimal 1808F, octal 300217).
What is the square root of 98447?
About 313.7626.
Is 98447 divisible by 3?
No. Its digits add up to 32, which is not a multiple of 3.
What is special about the number 98447?
98447 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 17 × 5791, the product of two primes.