The number 94315
94315 is a composite number with 8 divisors. Its prime factorisation is 5 × 13 × 1451. Divisors (8): 1, 5, 13, 65, 1451, 7255, 18863, 94315.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
94315 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
94315 is composite. Its prime factorisation is
- 3
The divisors add up to 121968; without 94315 itself that is 27653, so 94315 is deficient (27653 is less than 94315). Euler's totient φ(94315) = 69600 numbers up to 94315 share no factor with it.
- 4
The digits of 94315 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 128 steps to reach 1.
LaTeX source of the formulas on this page
\[ 94315 = 5 \times 13 \times 1451 \]
94315 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 121968 |
| Euler totient φ(n) | 69600 |
| Square | 8895319225 |
| Cube | 838962032705875 |
| Square root | 307.107473 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 128 |
| Scientific notation | 9.4315 × |
94315 in other forms
| Form | Value |
|---|---|
| In words | ninety-four thousand three hundred and fifteen |
| Binary (base 2) | 10111000001101011 |
| Octal (base 8) | 270153 |
| Hexadecimal (base 16) | 1706B |
| Base 3 | 11210101011 |
| As time | 94315 seconds = 26 h 11 min 55 s |
Is 94315 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 | Yes (94315 ÷ 5 = 18863) | 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 4) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | 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 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 94315 a prime number?
No. 94315 = 5 × 13 × 1451, so it is divisible by 5.
What are the factors of 94315?
1, 5, 13, 65, 1451, 7255, 18863, 94315.
What is 94315 in binary?
10111000001101011 (hexadecimal 1706B, octal 270153).
What is the square root of 94315?
About 307.1075.
Is 94315 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 94315?
It is a composite number with 8 divisors.