The number 15999
15999 is a composite number with 4 divisors. Its prime factorisation is 3 × 5333. Divisors (4): 1, 3, 5333, 15999.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 15999: a semiprime: 3 × 5333, the product of two primes.
- 2
15999 is composite. Its prime factorisation is
- 3
The divisors add up to 21336; without 15999 itself that is 5337, so 15999 is deficient (5337 is less than 15999). Euler's totient φ(15999) = 10664 numbers up to 15999 share no factor with it.
- 4
The digits of 15999 add up to 33, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 97 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15999 = 3 \times 5333 \]
15999 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 21336 |
| Euler totient φ(n) | 10664 |
| Square | 255968001 |
| Cube | 4095232047999 |
| Square root | 126.487153 |
| Digit sum / digital root | 33 / 6 |
| Collatz steps to 1 | 97 |
| Scientific notation | 1.5999 × |
15999 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand nine hundred and ninety-nine |
| Binary (base 2) | 11111001111111 |
| Octal (base 8) | 37177 |
| Hexadecimal (base 16) | 3E7F |
| Base 3 | 210221120 |
| As time | 15999 seconds = 4 h 26 min 39 s |
Is 15999 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 (15999 ÷ 3 = 5333) | 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 4) | 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 4) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 9) | 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 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 15999 a prime number?
No. 15999 = 3 × 5333, so it is divisible by 3.
What are the factors of 15999?
1, 3, 5333, 15999.
What is 15999 in binary?
11111001111111 (hexadecimal 3E7F, octal 37177).
What is the square root of 15999?
About 126.4872.
Is 15999 divisible by 3?
Yes. Its digits add up to 33, a multiple of 3.
What is special about the number 15999?
15999 is a semiprime: 3 × 5333, the product of two primes.