The number 94095
94095 is a composite number with 32 divisors. Its prime factorisation is × 5 × 17 × 41. Divisors (32): 1, 3, 5, 9, 15, 17, 27, 41, 45, 51, 85, 123, 135, 153, 205, 255 … 94095.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 94095: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 27.
- 2
94095 is composite. Its prime factorisation is
- 3
The divisors add up to 181440; without 94095 itself that is 87345, so 94095 is deficient (87345 is less than 94095). Euler's totient φ(94095) = 46080 numbers up to 94095 share no factor with it.
- 4
The digits of 94095 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 128 steps to reach 1.
LaTeX source of the formulas on this page
\[ 94095 = 3^{3} \times 5 \times 17 \times 41 \]94095 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 181440 |
| Euler totient φ(n) | 46080 |
| Square | 8853869025 |
| Cube | 833104805907375 |
| Square root | 306.749083 (= 3√10455) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 128 |
| Scientific notation | 9.4095 × |
94095 in other forms
| Form | Value |
|---|---|
| In words | ninety-four thousand and ninety-five |
| Binary (base 2) | 10110111110001111 |
| Octal (base 8) | 267617 |
| Hexadecimal (base 16) | 16F8F |
| Base 3 | 11210002000 |
| As time | 94095 seconds = 26 h 8 min 15 s |
Is 94095 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 (94095 ÷ 3 = 31365) | 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 | Yes (94095 ÷ 5 = 18819) | 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 1) | 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 | Yes (94095 ÷ 9 = 10455) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 5) | 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 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 94095 a prime number?
No. 94095 = × 5 × 17 × 41, so it is divisible by 3.
What are the factors of 94095?
1, 3, 5, 9, 15, 17, 27, 41, 45, 51, 85, 123, 135, 153, 205, 255, 369, 459, 615, 697, 765, 1107, 1845, 2091, 2295, 3485, 5535, 6273, 10455, 18819, 31365, 94095.
What is 94095 in binary?
10110111110001111 (hexadecimal 16F8F, octal 267617).
What is the square root of 94095?
About 306.7491, exactly 3√10455.
Is 94095 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 94095?
94095 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 27.