The number 15909
15909 is a composite number with 4 divisors. Its prime factorisation is 3 × 5303. Divisors (4): 1, 3, 5303, 15909.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 15909: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 3 × 5303, the product of two primes.
- 2
15909 is composite. Its prime factorisation is
- 3
The divisors add up to 21216; without 15909 itself that is 5307, so 15909 is deficient (5307 is less than 15909). Euler's totient φ(15909) = 10604 numbers up to 15909 share no factor with it.
- 4
The digits of 15909 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 146 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15909 = 3 \times 5303 \]
15909 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 21216 |
| Euler totient φ(n) | 10604 |
| Square | 253096281 |
| Cube | 4026508734429 |
| Square root | 126.130884 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 146 |
| Scientific notation | 1.5909 × |
15909 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand nine hundred and nine |
| Binary (base 2) | 11111000100101 |
| Octal (base 8) | 37045 |
| Hexadecimal (base 16) | 3E25 |
| Base 3 | 210211020 |
| As time | 15909 seconds = 4 h 25 min 9 s |
Is 15909 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 (15909 ÷ 3 = 5303) | 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 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 5) | 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 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 3) | 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 15909 a prime number?
No. 15909 = 3 × 5303, so it is divisible by 3.
What are the factors of 15909?
1, 3, 5303, 15909.
What is 15909 in binary?
11111000100101 (hexadecimal 3E25, octal 37045).
What is the square root of 15909?
About 126.1309.
Is 15909 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 15909?
15909 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 3 × 5303, the product of two primes.