The number 93947
93947 is a composite number with 4 divisors. Its prime factorisation is 7 × 13421. Divisors (4): 1, 7, 13421, 93947.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 93947: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 7 × 13421, the product of two primes.
- 2
93947 is composite. Its prime factorisation is
- 3
The divisors add up to 107376; without 93947 itself that is 13429, so 93947 is deficient (13429 is less than 93947). Euler's totient φ(93947) = 80520 numbers up to 93947 share no factor with it.
- 4
The digits of 93947 add up to 32, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 133 steps to reach 1.
LaTeX source of the formulas on this page
\[ 93947 = 7 \times 13421 \]
93947 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 107376 |
| Euler totient φ(n) | 80520 |
| Square | 8826038809 |
| Cube | 829179867989123 |
| Square root | 306.507749 |
| Digit sum / digital root | 32 / 5 |
| Collatz steps to 1 | 133 |
| Scientific notation | 9.3947 × |
93947 in other forms
| Form | Value |
|---|---|
| In words | ninety-three thousand nine hundred and forty-seven |
| Binary (base 2) | 10110111011111011 |
| Octal (base 8) | 267373 |
| Hexadecimal (base 16) | 16EFB |
| Base 3 | 11202212112 |
| As time | 93947 seconds = 26 h 5 min 47 s |
Is 93947 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 2) | 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 (93947 ÷ 7 = 13421) | 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 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 7) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | 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 93947 a prime number?
No. 93947 = 7 × 13421, so it is divisible by 7.
What are the factors of 93947?
1, 7, 13421, 93947.
What is 93947 in binary?
10110111011111011 (hexadecimal 16EFB, octal 267373).
What is the square root of 93947?
About 306.5077.
Is 93947 divisible by 3?
No. Its digits add up to 32, which is not a multiple of 3.
What is special about the number 93947?
93947 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 7 × 13421, the product of two primes.