The number 5465
5465 is a composite number with 4 divisors. Its prime factorisation is 5 × 1093. Divisors (4): 1, 5, 1093, 5465.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 5465: a semiprime: 5 × 1093, the product of two primes.
- 2
5465 is composite. Its prime factorisation is
- 3
The divisors add up to 6564; without 5465 itself that is 1099, so 5465 is deficient (1099 is less than 5465). Euler's totient φ(5465) = 4368 numbers up to 5465 share no factor with it.
- 4
The digits of 5465 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 160 steps to reach 1.
LaTeX source of the formulas on this page
\[ 5465 = 5 \times 1093 \]
5465 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 6564 |
| Euler totient φ(n) | 4368 |
| Square | 29866225 |
| Cube | 163218919625 |
| Square root | 73.925638 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 160 |
| Scientific notation | 5.465 × |
5465 in other forms
| Form | Value |
|---|---|
| In words | five thousand four hundred and sixty-five |
| Binary (base 2) | 1010101011001 |
| Octal (base 8) | 12531 |
| Hexadecimal (base 16) | 1559 |
| Base 3 | 21111102 |
| As time | 5465 seconds = 1 h 31 min 5 s |
Is 5465 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 2) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (5465 ÷ 5 = 1093) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 5) | 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 | No (remainder 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 5) | 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 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 5465 a prime number?
No. 5465 = 5 × 1093, so it is divisible by 5.
What are the factors of 5465?
1, 5, 1093, 5465.
What is 5465 in binary?
1010101011001 (hexadecimal 1559, octal 12531).
What is the square root of 5465?
About 73.9256.
Is 5465 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 5465?
5465 is a semiprime: 5 × 1093, the product of two primes.