The number 93961
93961 is a triangular number: 1 + 2 + … + 433 = 93961. Its prime factorisation is 7 × 31 × 433. Divisors (8): 1, 7, 31, 217, 433, 3031, 13423, 93961.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 93961: a triangular number: 1 + 2 + … + 433 = 93961; a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
93961 is composite. Its prime factorisation is
- 3
The divisors add up to 111104; without 93961 itself that is 17143, so 93961 is deficient (17143 is less than 93961). Euler's totient φ(93961) = 77760 numbers up to 93961 share no factor with it.
- 4
The digits of 93961 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 159 steps to reach 1.
LaTeX source of the formulas on this page
\[ 93961 = 7 \times 31 \times 433 \]
93961 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 111104 |
| Euler totient φ(n) | 77760 |
| Square | 8828669521 |
| Cube | 829550616862681 |
| Square root | 306.530586 |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 159 |
| Scientific notation | 9.3961 × |
93961 in other forms
| Form | Value |
|---|---|
| In words | ninety-three thousand nine hundred and sixty-one |
| Binary (base 2) | 10110111100001001 |
| Octal (base 8) | 267411 |
| Hexadecimal (base 16) | 16F09 |
| Base 3 | 11202220001 |
| As time | 93961 seconds = 26 h 6 min 1 s |
Is 93961 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 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 | Yes (93961 ÷ 7 = 13423) | 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 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 10) | 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 93961 a prime number?
No. 93961 = 7 × 31 × 433, so it is divisible by 7.
What are the factors of 93961?
1, 7, 31, 217, 433, 3031, 13423, 93961.
What is 93961 in binary?
10110111100001001 (hexadecimal 16F09, octal 267411).
What is the square root of 93961?
About 306.5306.
Is 93961 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 93961?
93961 is a triangular number: 1 + 2 + … + 433 = 93961; a happy number: repeatedly adding the squares of its digits reaches 1.