The number 15933
15933 is a composite number with 8 divisors. Its prime factorisation is 3 × 47 × 113. Divisors (8): 1, 3, 47, 113, 141, 339, 5311, 15933.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
15933 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
15933 is composite. Its prime factorisation is
- 3
The divisors add up to 21888; without 15933 itself that is 5955, so 15933 is deficient (5955 is less than 15933). Euler's totient φ(15933) = 10304 numbers up to 15933 share no factor with it.
- 4
The digits of 15933 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 53 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15933 = 3 \times 47 \times 113 \]
15933 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 21888 |
| Euler totient φ(n) | 10304 |
| Square | 253860489 |
| Cube | 4044759171237 |
| Square root | 126.225988 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 53 |
| Scientific notation | 1.5933 × |
15933 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand nine hundred and thirty-three |
| Binary (base 2) | 11111000111101 |
| Octal (base 8) | 37075 |
| Hexadecimal (base 16) | 3E3D |
| Base 3 | 210212010 |
| As time | 15933 seconds = 4 h 25 min 33 s |
Is 15933 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 (15933 ÷ 3 = 5311) | 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 1) | 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 5) | 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 5) | 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 15933 a prime number?
No. 15933 = 3 × 47 × 113, so it is divisible by 3.
What are the factors of 15933?
1, 3, 47, 113, 141, 339, 5311, 15933.
What is 15933 in binary?
11111000111101 (hexadecimal 3E3D, octal 37075).
What is the square root of 15933?
About 126.2260.
Is 15933 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 15933?
It is a composite number with 8 divisors.