The number 99561
99561 is a composite number with 16 divisors. Its prime factorisation is 3 × 7 × 11 × 431. Divisors (16): 1, 3, 7, 11, 21, 33, 77, 231, 431, 1293, 3017, 4741, 9051, 14223, 33187, 99561.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
99561 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
99561 is composite. Its prime factorisation is
- 3
The divisors add up to 165888; without 99561 itself that is 66327, so 99561 is deficient (66327 is less than 99561). Euler's totient φ(99561) = 51600 numbers up to 99561 share no factor with it.
- 4
The digits of 99561 add up to 30, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 141 steps to reach 1.
LaTeX source of the formulas on this page
\[ 99561 = 3 \times 7 \times 11 \times 431 \]
99561 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 165888 |
| Euler totient φ(n) | 51600 |
| Square | 9912392721 |
| Cube | 986887731695481 |
| Square root | 315.532883 |
| Digit sum / digital root | 30 / 3 |
| Collatz steps to 1 | 141 |
| Scientific notation | 9.9561 × |
99561 in other forms
| Form | Value |
|---|---|
| In words | ninety-nine thousand five hundred and sixty-one |
| Binary (base 2) | 11000010011101001 |
| Octal (base 8) | 302351 |
| Hexadecimal (base 16) | 184E9 |
| Base 3 | 12001120110 |
| As time | 99561 seconds = 27 h 39 min 21 s |
Is 99561 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 (99561 ÷ 3 = 33187) | 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 1) | 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 | Yes (99561 ÷ 7 = 14223) | 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 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (99561 ÷ 11 = 9051) | 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 99561 a prime number?
No. 99561 = 3 × 7 × 11 × 431, so it is divisible by 3.
What are the factors of 99561?
1, 3, 7, 11, 21, 33, 77, 231, 431, 1293, 3017, 4741, 9051, 14223, 33187, 99561.
What is 99561 in binary?
11000010011101001 (hexadecimal 184E9, octal 302351).
What is the square root of 99561?
About 315.5329.
Is 99561 divisible by 3?
Yes. Its digits add up to 30, a multiple of 3.
What is special about the number 99561?
It is a composite number with 16 divisors.