The number 8913
8913 is a binary palindrome (10001011010001). Its prime factorisation is 3 × 2971. Divisors (4): 1, 3, 2971, 8913.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 8913: a binary palindrome (10001011010001); a semiprime: 3 × 2971, the product of two primes.
- 2
8913 is composite. Its prime factorisation is
- 3
The divisors add up to 11888; without 8913 itself that is 2975, so 8913 is deficient (2975 is less than 8913). Euler's totient φ(8913) = 5940 numbers up to 8913 share no factor with it.
- 4
The digits of 8913 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 47 steps to reach 1.
LaTeX source of the formulas on this page
\[ 8913 = 3 \times 2971 \]
8913 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 11888 |
| Euler totient φ(n) | 5940 |
| Square | 79441569 |
| Cube | 708062704497 |
| Square root | 94.408686 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 47 |
| Scientific notation | 8.913 × |
8913 in other forms
| Form | Value |
|---|---|
| In words | eight thousand nine hundred and thirteen |
| Binary (base 2) | 10001011010001 |
| Octal (base 8) | 21321 |
| Hexadecimal (base 16) | 22D1 |
| Base 3 | 110020010 |
| As time | 8913 seconds = 2 h 28 min 33 s |
Is 8913 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 (8913 ÷ 3 = 2971) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | 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 2) | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 3) | 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 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 8913 a prime number?
No. 8913 = 3 × 2971, so it is divisible by 3.
What are the factors of 8913?
1, 3, 2971, 8913.
What is 8913 in binary?
10001011010001 (hexadecimal 22D1, octal 21321).
What is the square root of 8913?
About 94.4087.
Is 8913 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 8913?
8913 is a binary palindrome (10001011010001); a semiprime: 3 × 2971, the product of two primes.