The number 6455
6455 is a composite number with 4 divisors. Its prime factorisation is 5 × 1291. Divisors (4): 1, 5, 1291, 6455.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 6455: a semiprime: 5 × 1291, the product of two primes.
- 2
6455 is composite. Its prime factorisation is
- 3
The divisors add up to 7752; without 6455 itself that is 1297, so 6455 is deficient (1297 is less than 6455). Euler's totient φ(6455) = 5160 numbers up to 6455 share no factor with it.
- 4
The digits of 6455 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 106 steps to reach 1.
LaTeX source of the formulas on this page
\[ 6455 = 5 \times 1291 \]
6455 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 7752 |
| Euler totient φ(n) | 5160 |
| Square | 41667025 |
| Cube | 268960646375 |
| Square root | 80.343015 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 106 |
| Scientific notation | 6.455 × |
6455 in other forms
| Form | Value |
|---|---|
| In words | six thousand four hundred and fifty-five |
| Binary (base 2) | 1100100110111 |
| Octal (base 8) | 14467 |
| Hexadecimal (base 16) | 1937 |
| Base 3 | 22212002 |
| As time | 6455 seconds = 1 h 47 min 35 s |
Is 6455 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 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (6455 ÷ 5 = 1291) | 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 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 | No (remainder 7) | 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 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 6455 a prime number?
No. 6455 = 5 × 1291, so it is divisible by 5.
What are the factors of 6455?
1, 5, 1291, 6455.
What is 6455 in binary?
1100100110111 (hexadecimal 1937, octal 14467).
What is the square root of 6455?
About 80.3430.
Is 6455 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 6455?
6455 is a semiprime: 5 × 1291, the product of two primes.