The number 15306
15306 is a composite number with 8 divisors. Its prime factorisation is 2 × 3 × 2551. Divisors (8): 1, 2, 3, 6, 2551, 5102, 7653, 15306.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
15306 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
15306 is composite. Its prime factorisation is
- 3
The divisors add up to 30624; without 15306 itself that is 15318, so 15306 is abundant (15318 is more than 15306). Euler's totient φ(15306) = 5100 numbers up to 15306 share no factor with it.
- 4
The digits of 15306 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 84 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15306 = 2 \times 3 \times 2551 \]
15306 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 30624 |
| Euler totient φ(n) | 5100 |
| Square | 234273636 |
| Cube | 3585792272616 |
| Square root | 123.717420 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 84 |
| Scientific notation | 1.5306 × |
15306 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand three hundred and six |
| Binary (base 2) | 11101111001010 |
| Octal (base 8) | 35712 |
| Hexadecimal (base 16) | 3BCA |
| Base 3 | 202222220 |
| As time | 15306 seconds = 4 h 15 min 6 s |
Is 15306 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (15306 ÷ 2 = 7653) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (15306 ÷ 3 = 5102) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (15306 ÷ 6 = 2551) | 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 2) | 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 6) | 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 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 15306 a prime number?
No. 15306 = 2 × 3 × 2551, so it is divisible by 2.
What are the factors of 15306?
1, 2, 3, 6, 2551, 5102, 7653, 15306.
What is 15306 in binary?
11101111001010 (hexadecimal 3BCA, octal 35712).
What is the square root of 15306?
About 123.7174.
Is 15306 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 15306?
It is a composite number with 8 divisors.