The number 50472
50472 is a composite number with 24 divisors. Its prime factorisation is × × 701. Divisors (24): 1, 2, 3, 4, 6, 8, 9, 12, 18, 24, 36, 72, 701, 1402, 2103, 2804 … 50472.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50472: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 18.
- 2
50472 is composite. Its prime factorisation is
- 3
The divisors add up to 136890; without 50472 itself that is 86418, so 50472 is abundant (86418 is more than 50472). Euler's totient φ(50472) = 16800 numbers up to 50472 share no factor with it.
- 4
The digits of 50472 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 96 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50472 = 2^{3} \times 3^{2} \times 701 \]50472 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 136890 |
| Euler totient φ(n) | 16800 |
| Square | 2547422784 |
| Cube | 128573522754048 |
| Square root | 224.659743 (= 6√1402) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 96 |
| Scientific notation | 5.0472 × |
50472 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand four hundred and seventy-two |
| Binary (base 2) | 1100010100101000 |
| Octal (base 8) | 142450 |
| Hexadecimal (base 16) | C528 |
| Base 3 | 2120020100 |
| As time | 50472 seconds = 14 h 1 min 12 s |
Is 50472 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50472 ÷ 2 = 25236) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (50472 ÷ 3 = 16824) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (50472 ÷ 4 = 12618) | 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 (50472 ÷ 6 = 8412) | 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 (50472 ÷ 8 = 6309) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (50472 ÷ 9 = 5608) | 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 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (50472 ÷ 12 = 4206) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50472 a prime number?
No. 50472 = × × 701, so it is divisible by 2.
What are the factors of 50472?
1, 2, 3, 4, 6, 8, 9, 12, 18, 24, 36, 72, 701, 1402, 2103, 2804, 4206, 5608, 6309, 8412, 12618, 16824, 25236, 50472.
What is 50472 in binary?
1100010100101000 (hexadecimal C528, octal 142450).
What is the square root of 50472?
About 224.6597, exactly 6√1402.
Is 50472 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 50472?
50472 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 18.