The number 12465
12465 is a composite number with 12 divisors. Its prime factorisation is × 5 × 277. Divisors (12): 1, 3, 5, 9, 15, 45, 277, 831, 1385, 2493, 4155, 12465.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 12465: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
12465 is composite. Its prime factorisation is
- 3
The divisors add up to 21684; without 12465 itself that is 9219, so 12465 is deficient (9219 is less than 12465). Euler's totient φ(12465) = 6624 numbers up to 12465 share no factor with it.
- 4
The digits of 12465 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 63 steps to reach 1.
LaTeX source of the formulas on this page
\[ 12465 = 3^{2} \times 5 \times 277 \]12465 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 21684 |
| Euler totient φ(n) | 6624 |
| Square | 155376225 |
| Cube | 1936764644625 |
| Square root | 111.646764 (= 3√1385) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 63 |
| Scientific notation | 1.2465 × |
12465 in other forms
| Form | Value |
|---|---|
| In words | twelve thousand four hundred and sixty-five |
| Binary (base 2) | 11000010110001 |
| Octal (base 8) | 30261 |
| Hexadecimal (base 16) | 30B1 |
| Base 3 | 122002200 |
| As time | 12465 seconds = 3 h 27 min 45 s |
Is 12465 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 (12465 ÷ 3 = 4155) | 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 (12465 ÷ 5 = 2493) | 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 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (12465 ÷ 9 = 1385) | 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 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 12465 a prime number?
No. 12465 = × 5 × 277, so it is divisible by 3.
What are the factors of 12465?
1, 3, 5, 9, 15, 45, 277, 831, 1385, 2493, 4155, 12465.
What is 12465 in binary?
11000010110001 (hexadecimal 30B1, octal 30261).
What is the square root of 12465?
About 111.6468, exactly 3√1385.
Is 12465 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 12465?
12465 is a happy number: repeatedly adding the squares of its digits reaches 1.