The number 15369
15369 is a composite number with 8 divisors. Its prime factorisation is 3 × 47 × 109. Divisors (8): 1, 3, 47, 109, 141, 327, 5123, 15369.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
15369 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
15369 is composite. Its prime factorisation is
- 3
The divisors add up to 21120; without 15369 itself that is 5751, so 15369 is deficient (5751 is less than 15369). Euler's totient φ(15369) = 9936 numbers up to 15369 share no factor with it.
- 4
The digits of 15369 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 102 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15369 = 3 \times 47 \times 109 \]
15369 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 21120 |
| Euler totient φ(n) | 9936 |
| Square | 236206161 |
| Cube | 3630252488409 |
| Square root | 123.971771 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 102 |
| Scientific notation | 1.5369 × |
15369 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand three hundred and sixty-nine |
| Binary (base 2) | 11110000001001 |
| Octal (base 8) | 36011 |
| Hexadecimal (base 16) | 3C09 |
| Base 3 | 210002020 |
| As time | 15369 seconds = 4 h 16 min 9 s |
Is 15369 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 (15369 ÷ 3 = 5123) | 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 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 1) | 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 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 15369 a prime number?
No. 15369 = 3 × 47 × 109, so it is divisible by 3.
What are the factors of 15369?
1, 3, 47, 109, 141, 327, 5123, 15369.
What is 15369 in binary?
11110000001001 (hexadecimal 3C09, octal 36011).
What is the square root of 15369?
About 123.9718.
Is 15369 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 15369?
It is a composite number with 8 divisors.