The number 5467
5467 is a composite number with 8 divisors. Its prime factorisation is 7 × 11 × 71. Divisors (8): 1, 7, 11, 71, 77, 497, 781, 5467.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
5467 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
5467 is composite. Its prime factorisation is
- 3
The divisors add up to 6912; without 5467 itself that is 1445, so 5467 is deficient (1445 is less than 5467). Euler's totient φ(5467) = 4200 numbers up to 5467 share no factor with it.
- 4
The digits of 5467 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 116 steps to reach 1.
LaTeX source of the formulas on this page
\[ 5467 = 7 \times 11 \times 71 \]
5467 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 6912 |
| Euler totient φ(n) | 4200 |
| Square | 29888089 |
| Cube | 163398182563 |
| Square root | 73.939164 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 116 |
| Scientific notation | 5.467 × |
5467 in other forms
| Form | Value |
|---|---|
| In words | five thousand four hundred and sixty-seven |
| Binary (base 2) | 1010101011011 |
| Octal (base 8) | 12533 |
| Hexadecimal (base 16) | 155B |
| Base 3 | 21111111 |
| As time | 5467 seconds = 1 h 31 min 7 s |
Is 5467 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | 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 | No (remainder 3) | 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 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (5467 ÷ 7 = 781) | 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 | No (remainder 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 7) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (5467 ÷ 11 = 497) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 5467 a prime number?
No. 5467 = 7 × 11 × 71, so it is divisible by 7.
What are the factors of 5467?
1, 7, 11, 71, 77, 497, 781, 5467.
What is 5467 in binary?
1010101011011 (hexadecimal 155B, octal 12533).
What is the square root of 5467?
About 73.9392.
Is 5467 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 5467?
It is a composite number with 8 divisors.