The number 15899
15899 is a composite number with 4 divisors. Its prime factorisation is 13 × 1223. Divisors (4): 1, 13, 1223, 15899.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 15899: a semiprime: 13 × 1223, the product of two primes.
- 2
15899 is composite. Its prime factorisation is
- 3
The divisors add up to 17136; without 15899 itself that is 1237, so 15899 is deficient (1237 is less than 15899). Euler's totient φ(15899) = 14664 numbers up to 15899 share no factor with it.
- 4
The digits of 15899 add up to 32, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 159 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15899 = 13 \times 1223 \]
15899 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 17136 |
| Euler totient φ(n) | 14664 |
| Square | 252778201 |
| Cube | 4018920617699 |
| Square root | 126.091237 |
| Digit sum / digital root | 32 / 5 |
| Collatz steps to 1 | 159 |
| Scientific notation | 1.5899 × |
15899 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand eight hundred and ninety-nine |
| Binary (base 2) | 11111000011011 |
| Octal (base 8) | 37033 |
| Hexadecimal (base 16) | 3E1B |
| Base 3 | 210210212 |
| As time | 15899 seconds = 4 h 24 min 59 s |
Is 15899 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 4) | 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 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | 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 4) | 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 15899 a prime number?
No. 15899 = 13 × 1223, so it is divisible by 13.
What are the factors of 15899?
1, 13, 1223, 15899.
What is 15899 in binary?
11111000011011 (hexadecimal 3E1B, octal 37033).
What is the square root of 15899?
About 126.0912.
Is 15899 divisible by 3?
No. Its digits add up to 32, which is not a multiple of 3.
What is special about the number 15899?
15899 is a semiprime: 13 × 1223, the product of two primes.