The number 14959
14959 is a composite number with 4 divisors. Its prime factorisation is 7 × 2137. Divisors (4): 1, 7, 2137, 14959.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 14959: a semiprime: 7 × 2137, the product of two primes.
- 2
14959 is composite. Its prime factorisation is
- 3
The divisors add up to 17104; without 14959 itself that is 2145, so 14959 is deficient (2145 is less than 14959). Euler's totient φ(14959) = 12816 numbers up to 14959 share no factor with it.
- 4
The digits of 14959 add up to 28, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 115 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14959 = 7 \times 2137 \]
14959 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 17104 |
| Euler totient φ(n) | 12816 |
| Square | 223771681 |
| Cube | 3347400576079 |
| Square root | 122.306991 |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 115 |
| Scientific notation | 1.4959 × |
14959 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand nine hundred and fifty-nine |
| Binary (base 2) | 11101001101111 |
| Octal (base 8) | 35157 |
| Hexadecimal (base 16) | 3A6F |
| Base 3 | 202112001 |
| As time | 14959 seconds = 4 h 9 min 19 s |
Is 14959 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 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 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (14959 ÷ 7 = 2137) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | 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 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 14959 a prime number?
No. 14959 = 7 × 2137, so it is divisible by 7.
What are the factors of 14959?
1, 7, 2137, 14959.
What is 14959 in binary?
11101001101111 (hexadecimal 3A6F, octal 35157).
What is the square root of 14959?
About 122.3070.
Is 14959 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 14959?
14959 is a semiprime: 7 × 2137, the product of two primes.