The number 13141
13141 is a composite number with 4 divisors. Its prime factorisation is 17 × 773. Divisors (4): 1, 17, 773, 13141.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 13141: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 17 × 773, the product of two primes.
- 2
13141 is composite. Its prime factorisation is
- 3
The divisors add up to 13932; without 13141 itself that is 791, so 13141 is deficient (791 is less than 13141). Euler's totient φ(13141) = 12352 numbers up to 13141 share no factor with it.
- 4
The digits of 13141 add up to 10, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 32 steps to reach 1.
LaTeX source of the formulas on this page
\[ 13141 = 17 \times 773 \]
13141 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 13932 |
| Euler totient φ(n) | 12352 |
| Square | 172685881 |
| Cube | 2269265162221 |
| Square root | 114.634201 |
| Digit sum / digital root | 10 / 1 |
| Collatz steps to 1 | 32 |
| Scientific notation | 1.3141 × |
13141 in other forms
| Form | Value |
|---|---|
| In words | thirteen thousand one hundred and forty-one |
| Binary (base 2) | 11001101010101 |
| Octal (base 8) | 31525 |
| Hexadecimal (base 16) | 3355 |
| Base 3 | 200000201 |
| As time | 13141 seconds = 3 h 39 min 1 s |
Is 13141 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 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 1) | 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 1) | 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 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 13141 a prime number?
No. 13141 = 17 × 773, so it is divisible by 17.
What are the factors of 13141?
1, 17, 773, 13141.
What is 13141 in binary?
11001101010101 (hexadecimal 3355, octal 31525).
What is the square root of 13141?
About 114.6342.
Is 13141 divisible by 3?
No. Its digits add up to 10, which is not a multiple of 3.
What is special about the number 13141?
13141 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 17 × 773, the product of two primes.