The number 89507
89507 is a composite number with 8 divisors. Its prime factorisation is 11 × 79 × 103. Divisors (8): 1, 11, 79, 103, 869, 1133, 8137, 89507.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 89507: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
89507 is composite. Its prime factorisation is
- 3
The divisors add up to 99840; without 89507 itself that is 10333, so 89507 is deficient (10333 is less than 89507). Euler's totient φ(89507) = 79560 numbers up to 89507 share no factor with it.
- 4
The digits of 89507 add up to 29, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 71 steps to reach 1.
LaTeX source of the formulas on this page
\[ 89507 = 11 \times 79 \times 103 \]
89507 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 99840 |
| Euler totient φ(n) | 79560 |
| Square | 8011503049 |
| Cube | 717085603406843 |
| Square root | 299.177205 |
| Digit sum / digital root | 29 / 2 |
| Collatz steps to 1 | 71 |
| Scientific notation | 8.9507 × |
89507 in other forms
| Form | Value |
|---|---|
| In words | eighty-nine thousand five hundred and seven |
| Binary (base 2) | 10101110110100011 |
| Octal (base 8) | 256643 |
| Hexadecimal (base 16) | 15DA3 |
| Base 3 | 11112210002 |
| As time | 89507 seconds = 24 h 51 min 47 s |
Is 89507 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 | No (remainder 5) | 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 2) | 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 | Yes (89507 ÷ 11 = 8137) | 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 89507 a prime number?
No. 89507 = 11 × 79 × 103, so it is divisible by 11.
What are the factors of 89507?
1, 11, 79, 103, 869, 1133, 8137, 89507.
What is 89507 in binary?
10101110110100011 (hexadecimal 15DA3, octal 256643).
What is the square root of 89507?
About 299.1772.
Is 89507 divisible by 3?
No. Its digits add up to 29, which is not a multiple of 3.
What is special about the number 89507?
89507 is a happy number: repeatedly adding the squares of its digits reaches 1.