The number 50464
50464 is a composite number with 24 divisors. Its prime factorisation is × 19 × 83. Divisors (24): 1, 2, 4, 8, 16, 19, 32, 38, 76, 83, 152, 166, 304, 332, 608, 664 … 50464.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50464: a Harshad number: divisible by its digit sum 19.
- 2
50464 is composite. Its prime factorisation is
- 3
The divisors add up to 105840; without 50464 itself that is 55376, so 50464 is abundant (55376 is more than 50464). Euler's totient φ(50464) = 23616 numbers up to 50464 share no factor with it.
- 4
The digits of 50464 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 96 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50464 = 2^{5} \times 19 \times 83 \]50464 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 105840 |
| Euler totient φ(n) | 23616 |
| Square | 2546615296 |
| Cube | 128512394297344 |
| Square root | 224.641937 (= 4√3154) |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 96 |
| Scientific notation | 5.0464 × |
50464 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand four hundred and sixty-four |
| Binary (base 2) | 1100010100100000 |
| Octal (base 8) | 142440 |
| Hexadecimal (base 16) | C520 |
| Base 3 | 2120020001 |
| As time | 50464 seconds = 14 h 1 min 4 s |
Is 50464 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50464 ÷ 2 = 25232) | 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 (50464 ÷ 4 = 12616) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 4) | 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 1) | 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 (50464 ÷ 8 = 6308) | 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 4) | 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 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50464 a prime number?
No. 50464 = × 19 × 83, so it is divisible by 2.
What are the factors of 50464?
1, 2, 4, 8, 16, 19, 32, 38, 76, 83, 152, 166, 304, 332, 608, 664, 1328, 1577, 2656, 3154, 6308, 12616, 25232, 50464.
What is 50464 in binary?
1100010100100000 (hexadecimal C520, octal 142440).
What is the square root of 50464?
About 224.6419, exactly 4√3154.
Is 50464 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 50464?
50464 is a Harshad number: divisible by its digit sum 19.