The number 5345
5345 is a composite number with 4 divisors. Its prime factorisation is 5 × 1069. Divisors (4): 1, 5, 1069, 5345.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 5345: a semiprime: 5 × 1069, the product of two primes.
- 2
5345 is composite. Its prime factorisation is
- 3
The divisors add up to 6420; without 5345 itself that is 1075, so 5345 is deficient (1075 is less than 5345). Euler's totient φ(5345) = 4272 numbers up to 5345 share no factor with it.
- 4
The digits of 5345 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 160 steps to reach 1.
LaTeX source of the formulas on this page
\[ 5345 = 5 \times 1069 \]
5345 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 6420 |
| Euler totient φ(n) | 4272 |
| Square | 28569025 |
| Cube | 152701438625 |
| Square root | 73.109507 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 160 |
| Scientific notation | 5.345 × |
5345 in other forms
| Form | Value |
|---|---|
| In words | five thousand three hundred and forty-five |
| Binary (base 2) | 1010011100001 |
| Octal (base 8) | 12341 |
| Hexadecimal (base 16) | 14E1 |
| Base 3 | 21022222 |
| As time | 5345 seconds = 1 h 29 min 5 s |
Is 5345 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 (5345 ÷ 5 = 1069) | 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 4) | 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 8) | 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 10) | 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 5345 a prime number?
No. 5345 = 5 × 1069, so it is divisible by 5.
What are the factors of 5345?
1, 5, 1069, 5345.
What is 5345 in binary?
1010011100001 (hexadecimal 14E1, octal 12341).
What is the square root of 5345?
About 73.1095.
Is 5345 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 5345?
5345 is a semiprime: 5 × 1069, the product of two primes.