The number 12435
12435 is a composite number with 8 divisors. Its prime factorisation is 3 × 5 × 829. Divisors (8): 1, 3, 5, 15, 829, 2487, 4145, 12435.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 12435: a Harshad number: divisible by its digit sum 15.
- 2
12435 is composite. Its prime factorisation is
- 3
The divisors add up to 19920; without 12435 itself that is 7485, so 12435 is deficient (7485 is less than 12435). Euler's totient φ(12435) = 6624 numbers up to 12435 share no factor with it.
- 4
The digits of 12435 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 112 steps to reach 1.
LaTeX source of the formulas on this page
\[ 12435 = 3 \times 5 \times 829 \]
12435 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 19920 |
| Euler totient φ(n) | 6624 |
| Square | 154629225 |
| Cube | 1922814412875 |
| Square root | 111.512331 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 112 |
| Scientific notation | 1.2435 × |
12435 in other forms
| Form | Value |
|---|---|
| In words | twelve thousand four hundred and thirty-five |
| Binary (base 2) | 11000010010011 |
| Octal (base 8) | 30223 |
| Hexadecimal (base 16) | 3093 |
| Base 3 | 122001120 |
| As time | 12435 seconds = 3 h 27 min 15 s |
Is 12435 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 (12435 ÷ 3 = 4145) | 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 (12435 ÷ 5 = 2487) | 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 3) | 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 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 12435 a prime number?
No. 12435 = 3 × 5 × 829, so it is divisible by 3.
What are the factors of 12435?
1, 3, 5, 15, 829, 2487, 4145, 12435.
What is 12435 in binary?
11000010010011 (hexadecimal 3093, octal 30223).
What is the square root of 12435?
About 111.5123.
Is 12435 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 12435?
12435 is a Harshad number: divisible by its digit sum 15.