The number 7465
7465 is a composite number with 4 divisors. Its prime factorisation is 5 × 1493. Divisors (4): 1, 5, 1493, 7465.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 7465: a semiprime: 5 × 1493, the product of two primes.
- 2
7465 is composite. Its prime factorisation is
- 3
The divisors add up to 8964; without 7465 itself that is 1499, so 7465 is deficient (1499 is less than 7465). Euler's totient φ(7465) = 5968 numbers up to 7465 share no factor with it.
- 4
The digits of 7465 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 70 steps to reach 1.
LaTeX source of the formulas on this page
\[ 7465 = 5 \times 1493 \]
7465 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 8964 |
| Euler totient φ(n) | 5968 |
| Square | 55726225 |
| Cube | 415996269625 |
| Square root | 86.400231 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 70 |
| Scientific notation | 7.465 × |
7465 in other forms
| Form | Value |
|---|---|
| In words | seven thousand four hundred and sixty-five |
| Binary (base 2) | 1110100101001 |
| Octal (base 8) | 16451 |
| Hexadecimal (base 16) | 1D29 |
| Base 3 | 101020111 |
| As time | 7465 seconds = 2 h 4 min 25 s |
Is 7465 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 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (7465 ÷ 5 = 1493) | 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 3) | 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 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 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 7465 a prime number?
No. 7465 = 5 × 1493, so it is divisible by 5.
What are the factors of 7465?
1, 5, 1493, 7465.
What is 7465 in binary?
1110100101001 (hexadecimal 1D29, octal 16451).
What is the square root of 7465?
About 86.4002.
Is 7465 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 7465?
7465 is a semiprime: 5 × 1493, the product of two primes.