The number 94031
94031 is a composite number with 12 divisors. Its prime factorisation is × 19 × 101. Divisors (12): 1, 7, 19, 49, 101, 133, 707, 931, 1919, 4949, 13433, 94031.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
94031 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
94031 is composite. Its prime factorisation is
- 3
The divisors add up to 116280; without 94031 itself that is 22249, so 94031 is deficient (22249 is less than 94031). Euler's totient φ(94031) = 75600 numbers up to 94031 share no factor with it.
- 4
The digits of 94031 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 252 steps to reach 1.
LaTeX source of the formulas on this page
\[ 94031 = 7^{2} \times 19 \times 101 \]94031 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 116280 |
| Euler totient φ(n) | 75600 |
| Square | 8841828961 |
| Cube | 831406019031791 |
| Square root | 306.644746 (= 7√1919) |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 252 |
| Scientific notation | 9.4031 × |
94031 in other forms
| Form | Value |
|---|---|
| In words | ninety-four thousand and thirty-one |
| Binary (base 2) | 10110111101001111 |
| Octal (base 8) | 267517 |
| Hexadecimal (base 16) | 16F4F |
| Base 3 | 11202222122 |
| As time | 94031 seconds = 26 h 7 min 11 s |
Is 94031 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 2) | 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 | No (remainder 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (94031 ÷ 7 = 13433) | 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 | No (remainder 8) | 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 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 94031 a prime number?
No. 94031 = × 19 × 101, so it is divisible by 7.
What are the factors of 94031?
1, 7, 19, 49, 101, 133, 707, 931, 1919, 4949, 13433, 94031.
What is 94031 in binary?
10110111101001111 (hexadecimal 16F4F, octal 267517).
What is the square root of 94031?
About 306.6447, exactly 7√1919.
Is 94031 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 94031?
It is a composite number with 12 divisors.