The number 15450
15450 is a composite number with 24 divisors. Its prime factorisation is 2 × 3 × × 103. Divisors (24): 1, 2, 3, 5, 6, 10, 15, 25, 30, 50, 75, 103, 150, 206, 309, 515 … 15450.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 15450: a Harshad number: divisible by its digit sum 15.
- 2
15450 is composite. Its prime factorisation is
- 3
The divisors add up to 38688; without 15450 itself that is 23238, so 15450 is abundant (23238 is more than 15450). Euler's totient φ(15450) = 4080 numbers up to 15450 share no factor with it.
- 4
The digits of 15450 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 146 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15450 = 2 \times 3 \times 5^{2} \times 103 \]15450 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 38688 |
| Euler totient φ(n) | 4080 |
| Square | 238702500 |
| Cube | 3687953625000 |
| Square root | 124.298029 (= 5√618) |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 146 |
| Scientific notation | 1.545 × |
15450 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand four hundred and fifty |
| Binary (base 2) | 11110001011010 |
| Octal (base 8) | 36132 |
| Hexadecimal (base 16) | 3C5A |
| Base 3 | 210012020 |
| As time | 15450 seconds = 4 h 17 min 30 s |
Is 15450 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (15450 ÷ 2 = 7725) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (15450 ÷ 3 = 5150) | 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 | Yes (15450 ÷ 5 = 3090) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (15450 ÷ 6 = 2575) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 | Yes (15450 ÷ 10 = 1545) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | 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 15450 a prime number?
No. 15450 = 2 × 3 × × 103, so it is divisible by 2.
What are the factors of 15450?
1, 2, 3, 5, 6, 10, 15, 25, 30, 50, 75, 103, 150, 206, 309, 515, 618, 1030, 1545, 2575, 3090, 5150, 7725, 15450.
What is 15450 in binary?
11110001011010 (hexadecimal 3C5A, octal 36132).
What is the square root of 15450?
About 124.2980, exactly 5√618.
Is 15450 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 15450?
15450 is a Harshad number: divisible by its digit sum 15.