The number 13169
13169 is a composite number with 4 divisors. Its prime factorisation is 13 × 1013. Divisors (4): 1, 13, 1013, 13169.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 13169: a semiprime: 13 × 1013, the product of two primes.
- 2
13169 is composite. Its prime factorisation is
- 3
The divisors add up to 14196; without 13169 itself that is 1027, so 13169 is deficient (1027 is less than 13169). Euler's totient φ(13169) = 12144 numbers up to 13169 share no factor with it.
- 4
The digits of 13169 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 138 steps to reach 1.
LaTeX source of the formulas on this page
\[ 13169 = 13 \times 1013 \]
13169 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 14196 |
| Euler totient φ(n) | 12144 |
| Square | 173422561 |
| Cube | 2283801705809 |
| Square root | 114.756263 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 138 |
| Scientific notation | 1.3169 × |
13169 in other forms
| Form | Value |
|---|---|
| In words | thirteen thousand one hundred and sixty-nine |
| Binary (base 2) | 11001101110001 |
| Octal (base 8) | 31561 |
| Hexadecimal (base 16) | 3371 |
| Base 3 | 200001202 |
| As time | 13169 seconds = 3 h 39 min 29 s |
Is 13169 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 4) | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | 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 2) | 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 13169 a prime number?
No. 13169 = 13 × 1013, so it is divisible by 13.
What are the factors of 13169?
1, 13, 1013, 13169.
What is 13169 in binary?
11001101110001 (hexadecimal 3371, octal 31561).
What is the square root of 13169?
About 114.7563.
Is 13169 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 13169?
13169 is a semiprime: 13 × 1013, the product of two primes.