The number 14261
14261 is a composite number with 4 divisors. Its prime factorisation is 13 × 1097. Divisors (4): 1, 13, 1097, 14261.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 14261: a semiprime: 13 × 1097, the product of two primes.
- 2
14261 is composite. Its prime factorisation is
- 3
The divisors add up to 15372; without 14261 itself that is 1111, so 14261 is deficient (1111 is less than 14261). Euler's totient φ(14261) = 13152 numbers up to 14261 share no factor with it.
- 4
The digits of 14261 add up to 14, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 50 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14261 = 13 \times 1097 \]
14261 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 15372 |
| Euler totient φ(n) | 13152 |
| Square | 203376121 |
| Cube | 2900346861581 |
| Square root | 119.419429 |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 50 |
| Scientific notation | 1.4261 × |
14261 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand two hundred and sixty-one |
| Binary (base 2) | 11011110110101 |
| Octal (base 8) | 33665 |
| Hexadecimal (base 16) | 37B5 |
| Base 3 | 201120012 |
| As time | 14261 seconds = 3 h 57 min 41 s |
Is 14261 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 2) | 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 | No (remainder 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | 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 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 14261 a prime number?
No. 14261 = 13 × 1097, so it is divisible by 13.
What are the factors of 14261?
1, 13, 1097, 14261.
What is 14261 in binary?
11011110110101 (hexadecimal 37B5, octal 33665).
What is the square root of 14261?
About 119.4194.
Is 14261 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 14261?
14261 is a semiprime: 13 × 1097, the product of two primes.