The number 1465
1465 is a composite number with 4 divisors. Its prime factorisation is 5 × 293. Divisors (4): 1, 5, 293, 1465.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 1465: a semiprime: 5 × 293, the product of two primes.
- 2
1465 is composite. Its prime factorisation is
- 3
The divisors add up to 1764; without 1465 itself that is 299, so 1465 is deficient (299 is less than 1465). Euler's totient φ(1465) = 1168 numbers up to 1465 share no factor with it.
- 4
The digits of 1465 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 34 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1465 = 5 \times 293 \]
1465 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 1764 |
| Euler totient φ(n) | 1168 |
| Square | 2146225 |
| Cube | 3144219625 |
| Square root | 38.275318 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 34 |
| Scientific notation | 1.465 × |
1465 in other forms
| Form | Value |
|---|---|
| In words | one thousand four hundred and sixty-five |
| Roman numerals | MCDLXV |
| Binary (base 2) | 10110111001 |
| Octal (base 8) | 2671 |
| Hexadecimal (base 16) | 5B9 |
| Base 3 | 2000021 |
| As time | 1465 seconds = 24 min 25 s |
Is 1465 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 (1465 ÷ 5 = 293) | 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 2) | 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 7) | 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 2) | 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 1465 a prime number?
No. 1465 = 5 × 293, so it is divisible by 5.
What are the factors of 1465?
1, 5, 293, 1465.
What is 1465 in binary?
10110111001 (hexadecimal 5B9, octal 2671).
What is the square root of 1465?
About 38.2753.
What is 1465 in Roman numerals?
MCDLXV.
Is 1465 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 1465?
1465 is a semiprime: 5 × 293, the product of two primes.