The number 14472
14472 is a composite number with 32 divisors. Its prime factorisation is × × 67. Divisors (32): 1, 2, 3, 4, 6, 8, 9, 12, 18, 24, 27, 36, 54, 67, 72, 108 … 14472.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 14472: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 18.
- 2
14472 is composite. Its prime factorisation is
- 3
The divisors add up to 40800; without 14472 itself that is 26328, so 14472 is abundant (26328 is more than 14472). Euler's totient φ(14472) = 4752 numbers up to 14472 share no factor with it.
- 4
The digits of 14472 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 58 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14472 = 2^{3} \times 3^{3} \times 67 \]14472 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 40800 |
| Euler totient φ(n) | 4752 |
| Square | 209438784 |
| Cube | 3030998082048 |
| Square root | 120.299626 (= 6√402) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 58 |
| Scientific notation | 1.4472 × |
14472 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand four hundred and seventy-two |
| Binary (base 2) | 11100010001000 |
| Octal (base 8) | 34210 |
| Hexadecimal (base 16) | 3888 |
| Base 3 | 201212000 |
| As time | 14472 seconds = 4 h 1 min 12 s |
Is 14472 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (14472 ÷ 2 = 7236) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (14472 ÷ 3 = 4824) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (14472 ÷ 4 = 3618) | 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 (14472 ÷ 6 = 2412) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 (14472 ÷ 8 = 1809) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (14472 ÷ 9 = 1608) | 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 | Yes (14472 ÷ 12 = 1206) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 14472 a prime number?
No. 14472 = × × 67, so it is divisible by 2.
What are the factors of 14472?
1, 2, 3, 4, 6, 8, 9, 12, 18, 24, 27, 36, 54, 67, 72, 108, 134, 201, 216, 268, 402, 536, 603, 804, 1206, 1608, 1809, 2412, 3618, 4824, 7236, 14472.
What is 14472 in binary?
11100010001000 (hexadecimal 3888, octal 34210).
What is the square root of 14472?
About 120.2996, exactly 6√402.
Is 14472 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 14472?
14472 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 18.