The number 95833
95833 is a composite number with 4 divisors. Its prime factorisation is 47 × 2039. Divisors (4): 1, 47, 2039, 95833.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 95833: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 47 × 2039, the product of two primes.
- 2
95833 is composite. Its prime factorisation is
- 3
The divisors add up to 97920; without 95833 itself that is 2087, so 95833 is deficient (2087 is less than 95833). Euler's totient φ(95833) = 93748 numbers up to 95833 share no factor with it.
- 4
The digits of 95833 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 97 steps to reach 1.
LaTeX source of the formulas on this page
\[ 95833 = 47 \times 2039 \]
95833 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 97920 |
| Euler totient φ(n) | 93748 |
| Square | 9183963889 |
| Cube | 880126811374537 |
| Square root | 309.569055 |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 97 |
| Scientific notation | 9.5833 × |
95833 in other forms
| Form | Value |
|---|---|
| In words | ninety-five thousand eight hundred and thirty-three |
| Binary (base 2) | 10111011001011001 |
| Octal (base 8) | 273131 |
| Hexadecimal (base 16) | 17659 |
| Base 3 | 11212110101 |
| As time | 95833 seconds = 26 h 37 min 13 s |
Is 95833 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 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 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 1) | 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 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 95833 a prime number?
No. 95833 = 47 × 2039, so it is divisible by 47.
What are the factors of 95833?
1, 47, 2039, 95833.
What is 95833 in binary?
10111011001011001 (hexadecimal 17659, octal 273131).
What is the square root of 95833?
About 309.5691.
Is 95833 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 95833?
95833 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 47 × 2039, the product of two primes.