The number 14259
14259 is a composite number with 12 divisors. Its prime factorisation is 3 × × 97. Divisors (12): 1, 3, 7, 21, 49, 97, 147, 291, 679, 2037, 4753, 14259.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 14259: a Harshad number: divisible by its digit sum 21.
- 2
14259 is composite. Its prime factorisation is
- 3
The divisors add up to 22344; without 14259 itself that is 8085, so 14259 is deficient (8085 is less than 14259). Euler's totient φ(14259) = 8064 numbers up to 14259 share no factor with it.
- 4
The digits of 14259 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 120 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14259 = 3 \times 7^{2} \times 97 \]14259 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 22344 |
| Euler totient φ(n) | 8064 |
| Square | 203319081 |
| Cube | 2899126775979 |
| Square root | 119.411055 (= 7√291) |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 120 |
| Scientific notation | 1.4259 × |
14259 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand two hundred and fifty-nine |
| Binary (base 2) | 11011110110011 |
| Octal (base 8) | 33663 |
| Hexadecimal (base 16) | 37B3 |
| Base 3 | 201120010 |
| As time | 14259 seconds = 3 h 57 min 39 s |
Is 14259 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 (14259 ÷ 3 = 4753) | 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 | No (remainder 4) | 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 | Yes (14259 ÷ 7 = 2037) | 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 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 9) | 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 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 14259 a prime number?
No. 14259 = 3 × × 97, so it is divisible by 3.
What are the factors of 14259?
1, 3, 7, 21, 49, 97, 147, 291, 679, 2037, 4753, 14259.
What is 14259 in binary?
11011110110011 (hexadecimal 37B3, octal 33663).
What is the square root of 14259?
About 119.4111, exactly 7√291.
Is 14259 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 14259?
14259 is a Harshad number: divisible by its digit sum 21.