The number 15462
15462 is a composite number with 12 divisors. Its prime factorisation is 2 × × 859. Divisors (12): 1, 2, 3, 6, 9, 18, 859, 1718, 2577, 5154, 7731, 15462.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 15462: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 18.
- 2
15462 is composite. Its prime factorisation is
- 3
The divisors add up to 33540; without 15462 itself that is 18078, so 15462 is abundant (18078 is more than 15462). Euler's totient φ(15462) = 5148 numbers up to 15462 share no factor with it.
- 4
The digits of 15462 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 146 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15462 = 2 \times 3^{2} \times 859 \]15462 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 33540 |
| Euler totient φ(n) | 5148 |
| Square | 239073444 |
| Cube | 3696553591128 |
| Square root | 124.346291 (= 3√1718) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 146 |
| Scientific notation | 1.5462 × |
15462 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand four hundred and sixty-two |
| Binary (base 2) | 11110001100110 |
| Octal (base 8) | 36146 |
| Hexadecimal (base 16) | 3C66 |
| Base 3 | 210012200 |
| As time | 15462 seconds = 4 h 17 min 42 s |
Is 15462 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (15462 ÷ 2 = 7731) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (15462 ÷ 3 = 5154) | 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 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (15462 ÷ 6 = 2577) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (15462 ÷ 9 = 1718) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | 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 15462 a prime number?
No. 15462 = 2 × × 859, so it is divisible by 2.
What are the factors of 15462?
1, 2, 3, 6, 9, 18, 859, 1718, 2577, 5154, 7731, 15462.
What is 15462 in binary?
11110001100110 (hexadecimal 3C66, octal 36146).
What is the square root of 15462?
About 124.3463, exactly 3√1718.
Is 15462 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 15462?
15462 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 18.