The number 12472
12472 is a composite number with 8 divisors. Its prime factorisation is × 1559. Divisors (8): 1, 2, 4, 8, 1559, 3118, 6236, 12472.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
12472 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
12472 is composite. Its prime factorisation is
- 3
The divisors add up to 23400; without 12472 itself that is 10928, so 12472 is deficient (10928 is less than 12472). Euler's totient φ(12472) = 6232 numbers up to 12472 share no factor with it.
- 4
The digits of 12472 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 63 steps to reach 1.
LaTeX source of the formulas on this page
\[ 12472 = 2^{3} \times 1559 \]12472 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 23400 |
| Euler totient φ(n) | 6232 |
| Square | 155550784 |
| Cube | 1940029378048 |
| Square root | 111.678109 (= 2√3118) |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 63 |
| Scientific notation | 1.2472 × |
12472 in other forms
| Form | Value |
|---|---|
| In words | twelve thousand four hundred and seventy-two |
| Binary (base 2) | 11000010111000 |
| Octal (base 8) | 30270 |
| Hexadecimal (base 16) | 30B8 |
| Base 3 | 122002221 |
| As time | 12472 seconds = 3 h 27 min 52 s |
Is 12472 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (12472 ÷ 2 = 6236) | 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 (12472 ÷ 4 = 3118) | 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 5) | 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 (12472 ÷ 8 = 1559) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | 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 9) | 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 12472 a prime number?
No. 12472 = × 1559, so it is divisible by 2.
What are the factors of 12472?
1, 2, 4, 8, 1559, 3118, 6236, 12472.
What is 12472 in binary?
11000010111000 (hexadecimal 30B8, octal 30270).
What is the square root of 12472?
About 111.6781, exactly 2√3118.
Is 12472 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 12472?
It is a composite number with 8 divisors.