The number 13975
13975 is a composite number with 12 divisors. Its prime factorisation is × 13 × 43. Divisors (12): 1, 5, 13, 25, 43, 65, 215, 325, 559, 1075, 2795, 13975.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 13975: a Harshad number: divisible by its digit sum 25.
- 2
13975 is composite. Its prime factorisation is
- 3
The divisors add up to 19096; without 13975 itself that is 5121, so 13975 is deficient (5121 is less than 13975). Euler's totient φ(13975) = 10080 numbers up to 13975 share no factor with it.
- 4
The digits of 13975 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 151 steps to reach 1.
LaTeX source of the formulas on this page
\[ 13975 = 5^{2} \times 13 \times 43 \]13975 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 19096 |
| Euler totient φ(n) | 10080 |
| Square | 195300625 |
| Cube | 2729326234375 |
| Square root | 118.215904 (= 5√559) |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 151 |
| Scientific notation | 1.3975 × |
13975 in other forms
| Form | Value |
|---|---|
| In words | thirteen thousand nine hundred and seventy-five |
| Binary (base 2) | 11011010010111 |
| Octal (base 8) | 33227 |
| Hexadecimal (base 16) | 3697 |
| Base 3 | 201011121 |
| As time | 13975 seconds = 3 h 52 min 55 s |
Is 13975 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 | Yes (13975 ÷ 5 = 2795) | 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 | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | 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 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 13975 a prime number?
No. 13975 = × 13 × 43, so it is divisible by 5.
What are the factors of 13975?
1, 5, 13, 25, 43, 65, 215, 325, 559, 1075, 2795, 13975.
What is 13975 in binary?
11011010010111 (hexadecimal 3697, octal 33227).
What is the square root of 13975?
About 118.2159, exactly 5√559.
Is 13975 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 13975?
13975 is a Harshad number: divisible by its digit sum 25.