The number 96429
96429 is a composite number with 4 divisors. Its prime factorisation is 3 × 32143. Divisors (4): 1, 3, 32143, 96429.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 96429: a semiprime: 3 × 32143, the product of two primes.
- 2
96429 is composite. Its prime factorisation is
- 3
The divisors add up to 128576; without 96429 itself that is 32147, so 96429 is deficient (32147 is less than 96429). Euler's totient φ(96429) = 64284 numbers up to 96429 share no factor with it.
- 4
The digits of 96429 add up to 30, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 45 steps to reach 1.
LaTeX source of the formulas on this page
\[ 96429 = 3 \times 32143 \]
96429 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 128576 |
| Euler totient φ(n) | 64284 |
| Square | 9298552041 |
| Cube | 896650074761589 |
| Square root | 310.530192 |
| Digit sum / digital root | 30 / 3 |
| Collatz steps to 1 | 45 |
| Scientific notation | 9.6429 × |
96429 in other forms
| Form | Value |
|---|---|
| In words | ninety-six thousand four hundred and twenty-nine |
| Binary (base 2) | 10111100010101101 |
| Octal (base 8) | 274255 |
| Hexadecimal (base 16) | 178AD |
| Base 3 | 11220021110 |
| As time | 96429 seconds = 26 h 47 min 9 s |
Is 96429 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 | Yes (96429 ÷ 3 = 32143) | 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 4) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 96429 a prime number?
No. 96429 = 3 × 32143, so it is divisible by 3.
What are the factors of 96429?
1, 3, 32143, 96429.
What is 96429 in binary?
10111100010101101 (hexadecimal 178AD, octal 274255).
What is the square root of 96429?
About 310.5302.
Is 96429 divisible by 3?
Yes. Its digits add up to 30, a multiple of 3.
What is special about the number 96429?
96429 is a semiprime: 3 × 32143, the product of two primes.