The number 96413
96413 is a composite number with 4 divisors. Its prime factorisation is 67 × 1439. Divisors (4): 1, 67, 1439, 96413.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 96413: a semiprime: 67 × 1439, the product of two primes.
- 2
96413 is composite. Its prime factorisation is
- 3
The divisors add up to 97920; without 96413 itself that is 1507, so 96413 is deficient (1507 is less than 96413). Euler's totient φ(96413) = 94908 numbers up to 96413 share no factor with it.
- 4
The digits of 96413 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 45 steps to reach 1.
LaTeX source of the formulas on this page
\[ 96413 = 67 \times 1439 \]
96413 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 97920 |
| Euler totient φ(n) | 94908 |
| Square | 9295466569 |
| Cube | 896203818316997 |
| Square root | 310.504428 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 45 |
| Scientific notation | 9.6413 × |
96413 in other forms
| Form | Value |
|---|---|
| In words | ninety-six thousand four hundred and thirteen |
| Binary (base 2) | 10111100010011101 |
| Octal (base 8) | 274235 |
| Hexadecimal (base 16) | 1789D |
| Base 3 | 11220020212 |
| As time | 96413 seconds = 26 h 46 min 53 s |
Is 96413 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 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | 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 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 5) | 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 3) | 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 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 96413 a prime number?
No. 96413 = 67 × 1439, so it is divisible by 67.
What are the factors of 96413?
1, 67, 1439, 96413.
What is 96413 in binary?
10111100010011101 (hexadecimal 1789D, octal 274235).
What is the square root of 96413?
About 310.5044.
Is 96413 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 96413?
96413 is a semiprime: 67 × 1439, the product of two primes.