The number 5395
5395 is a composite number with 8 divisors. Its prime factorisation is 5 × 13 × 83. Divisors (8): 1, 5, 13, 65, 83, 415, 1079, 5395.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
5395 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
5395 is composite. Its prime factorisation is
- 3
The divisors add up to 7056; without 5395 itself that is 1661, so 5395 is deficient (1661 is less than 5395). Euler's totient φ(5395) = 3936 numbers up to 5395 share no factor with it.
- 4
The digits of 5395 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 160 steps to reach 1.
LaTeX source of the formulas on this page
\[ 5395 = 5 \times 13 \times 83 \]
5395 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 7056 |
| Euler totient φ(n) | 3936 |
| Square | 29106025 |
| Cube | 157027004875 |
| Square root | 73.450664 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 160 |
| Scientific notation | 5.395 × |
5395 in other forms
| Form | Value |
|---|---|
| In words | five thousand three hundred and ninety-five |
| Binary (base 2) | 1010100010011 |
| Octal (base 8) | 12423 |
| Hexadecimal (base 16) | 1513 |
| Base 3 | 21101211 |
| As time | 5395 seconds = 1 h 29 min 55 s |
Is 5395 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 | Yes (5395 ÷ 5 = 1079) | 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 | 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 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 5) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | 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 5395 a prime number?
No. 5395 = 5 × 13 × 83, so it is divisible by 5.
What are the factors of 5395?
1, 5, 13, 65, 83, 415, 1079, 5395.
What is 5395 in binary?
1010100010011 (hexadecimal 1513, octal 12423).
What is the square root of 5395?
About 73.4507.
Is 5395 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 5395?
It is a composite number with 8 divisors.