The number 95671
95671 is a composite number with 4 divisors. Its prime factorisation is 29 × 3299. Divisors (4): 1, 29, 3299, 95671.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 95671: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 29 × 3299, the product of two primes.
- 2
95671 is composite. Its prime factorisation is
- 3
The divisors add up to 99000; without 95671 itself that is 3329, so 95671 is deficient (3329 is less than 95671). Euler's totient φ(95671) = 92344 numbers up to 95671 share no factor with it.
- 4
The digits of 95671 add up to 28, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 115 steps to reach 1.
LaTeX source of the formulas on this page
\[ 95671 = 29 \times 3299 \]
95671 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 99000 |
| Euler totient φ(n) | 92344 |
| Square | 9152940241 |
| Cube | 875670945796711 |
| Square root | 309.307291 |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 115 |
| Scientific notation | 9.5671 × |
95671 in other forms
| Form | Value |
|---|---|
| In words | ninety-five thousand six hundred and seventy-one |
| Binary (base 2) | 10111010110110111 |
| Octal (base 8) | 272667 |
| Hexadecimal (base 16) | 175B7 |
| Base 3 | 11212020101 |
| As time | 95671 seconds = 26 h 34 min 31 s |
Is 95671 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 1) | 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 7) | 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 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 4) | 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 95671 a prime number?
No. 95671 = 29 × 3299, so it is divisible by 29.
What are the factors of 95671?
1, 29, 3299, 95671.
What is 95671 in binary?
10111010110110111 (hexadecimal 175B7, octal 272667).
What is the square root of 95671?
About 309.3073.
Is 95671 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 95671?
95671 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 29 × 3299, the product of two primes.