The number 465
465 is a triangular number: 1 + 2 + … + 30 = 465. Its prime factorisation is 3 × 5 × 31. Divisors (8): 1, 3, 5, 15, 31, 93, 155, 465.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 465: a triangular number: 1 + 2 + … + 30 = 465; a Harshad number: divisible by its digit sum 15.
- 2
465 is composite. Its prime factorisation is
- 3
The divisors add up to 768; without 465 itself that is 303, so 465 is deficient (303 is less than 465). Euler's totient φ(465) = 240 numbers up to 465 share no factor with it.
- 4
The digits of 465 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 35 steps to reach 1.
LaTeX source of the formulas on this page
\[ 465 = 3 \times 5 \times 31 \]
465 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 768 |
| Euler totient φ(n) | 240 |
| Square | 216225 |
| Cube | 100544625 |
| Square root | 21.563859 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 35 |
| Scientific notation | 4.65 × |
465 in other forms
| Form | Value |
|---|---|
| In words | four hundred and sixty-five |
| Roman numerals | CDLXV |
| Binary (base 2) | 111010001 |
| Octal (base 8) | 721 |
| Hexadecimal (base 16) | 1D1 |
| Base 3 | 122020 |
| As time | 465 seconds = 7 min 45 s |
Is 465 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 | Yes (465 ÷ 3 = 155) | 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 (465 ÷ 5 = 93) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | 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 6) | 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 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 465 a prime number?
No. 465 = 3 × 5 × 31, so it is divisible by 3.
What are the factors of 465?
1, 3, 5, 15, 31, 93, 155, 465.
What is 465 in binary?
111010001 (hexadecimal 1D1, octal 721).
What is the square root of 465?
About 21.5639.
What is 465 in Roman numerals?
CDLXV.
Is 465 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 465?
465 is a triangular number: 1 + 2 + … + 30 = 465; a Harshad number: divisible by its digit sum 15.