The number 15472
15472 is a composite number with 10 divisors. Its prime factorisation is × 967. Divisors (10): 1, 2, 4, 8, 16, 967, 1934, 3868, 7736, 15472.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
15472 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
15472 is composite. Its prime factorisation is
- 3
The divisors add up to 30008; without 15472 itself that is 14536, so 15472 is deficient (14536 is less than 15472). Euler's totient φ(15472) = 7728 numbers up to 15472 share no factor with it.
- 4
The digits of 15472 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 146 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15472 = 2^{4} \times 967 \]15472 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 10 |
| Sum of divisors | 30008 |
| Euler totient φ(n) | 7728 |
| Square | 239382784 |
| Cube | 3703730434048 |
| Square root | 124.386494 (= 4√967) |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 146 |
| Scientific notation | 1.5472 × |
15472 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand four hundred and seventy-two |
| Binary (base 2) | 11110001110000 |
| Octal (base 8) | 36160 |
| Hexadecimal (base 16) | 3C70 |
| Base 3 | 210020001 |
| As time | 15472 seconds = 4 h 17 min 52 s |
Is 15472 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (15472 ÷ 2 = 7736) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 1) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (15472 ÷ 4 = 3868) | 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 | No (remainder 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 | Yes (15472 ÷ 8 = 1934) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | 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 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 15472 a prime number?
No. 15472 = × 967, so it is divisible by 2.
What are the factors of 15472?
1, 2, 4, 8, 16, 967, 1934, 3868, 7736, 15472.
What is 15472 in binary?
11110001110000 (hexadecimal 3C70, octal 36160).
What is the square root of 15472?
About 124.3865, exactly 4√967.
Is 15472 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 15472?
It is a composite number with 10 divisors.