The number 15633
15633 is a composite number with 10 divisors. Its prime factorisation is × 193. Divisors (10): 1, 3, 9, 27, 81, 193, 579, 1737, 5211, 15633.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
15633 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
15633 is composite. Its prime factorisation is
- 3
The divisors add up to 23474; without 15633 itself that is 7841, so 15633 is deficient (7841 is less than 15633). Euler's totient φ(15633) = 10368 numbers up to 15633 share no factor with it.
- 4
The digits of 15633 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 40 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15633 = 3^{4} \times 193 \]15633 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 10 |
| Sum of divisors | 23474 |
| Euler totient φ(n) | 10368 |
| Square | 244390689 |
| Cube | 3820559641137 |
| Square root | 125.031996 (= 9√193) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 40 |
| Scientific notation | 1.5633 × |
15633 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand six hundred and thirty-three |
| Binary (base 2) | 11110100010001 |
| Octal (base 8) | 36421 |
| Hexadecimal (base 16) | 3D11 |
| Base 3 | 210110000 |
| As time | 15633 seconds = 4 h 20 min 33 s |
Is 15633 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 (15633 ÷ 3 = 5211) | 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 | Yes (15633 ÷ 9 = 1737) | 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 2) | 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 15633 a prime number?
No. 15633 = × 193, so it is divisible by 3.
What are the factors of 15633?
1, 3, 9, 27, 81, 193, 579, 1737, 5211, 15633.
What is 15633 in binary?
11110100010001 (hexadecimal 3D11, octal 36421).
What is the square root of 15633?
About 125.0320, exactly 9√193.
Is 15633 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 15633?
It is a composite number with 10 divisors.