The number 91950
91950 is a composite number with 24 divisors. Its prime factorisation is 2 × 3 × × 613. Divisors (24): 1, 2, 3, 5, 6, 10, 15, 25, 30, 50, 75, 150, 613, 1226, 1839, 3065 … 91950.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 91950: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
91950 is composite. Its prime factorisation is
- 3
The divisors add up to 228408; without 91950 itself that is 136458, so 91950 is abundant (136458 is more than 91950). Euler's totient φ(91950) = 24480 numbers up to 91950 share no factor with it.
- 4
The digits of 91950 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 32 steps to reach 1.
LaTeX source of the formulas on this page
\[ 91950 = 2 \times 3 \times 5^{2} \times 613 \]91950 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 228408 |
| Euler totient φ(n) | 24480 |
| Square | 8454802500 |
| Cube | 777419089875000 |
| Square root | 303.232584 (= 5√3678) |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 32 |
| Scientific notation | 9.195 × |
91950 in other forms
| Form | Value |
|---|---|
| In words | ninety-one thousand nine hundred and fifty |
| Binary (base 2) | 10110011100101110 |
| Octal (base 8) | 263456 |
| Hexadecimal (base 16) | 1672E |
| Base 3 | 11200010120 |
| As time | 91950 seconds = 25 h 32 min 30 s |
Is 91950 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (91950 ÷ 2 = 45975) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (91950 ÷ 3 = 30650) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (91950 ÷ 5 = 18390) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (91950 ÷ 6 = 15325) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (91950 ÷ 10 = 9195) | 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 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 91950 a prime number?
No. 91950 = 2 × 3 × × 613, so it is divisible by 2.
What are the factors of 91950?
1, 2, 3, 5, 6, 10, 15, 25, 30, 50, 75, 150, 613, 1226, 1839, 3065, 3678, 6130, 9195, 15325, 18390, 30650, 45975, 91950.
What is 91950 in binary?
10110011100101110 (hexadecimal 1672E, octal 263456).
What is the square root of 91950?
About 303.2326, exactly 5√3678.
Is 91950 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 91950?
91950 is a happy number: repeatedly adding the squares of its digits reaches 1.