The number 15169
15169 is a composite number with 8 divisors. Its prime factorisation is 7 × 11 × 197. Divisors (8): 1, 7, 11, 77, 197, 1379, 2167, 15169.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
15169 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
15169 is composite. Its prime factorisation is
- 3
The divisors add up to 19008; without 15169 itself that is 3839, so 15169 is deficient (3839 is less than 15169). Euler's totient φ(15169) = 11760 numbers up to 15169 share no factor with it.
- 4
The digits of 15169 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 40 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15169 = 7 \times 11 \times 197 \]
15169 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 19008 |
| Euler totient φ(n) | 11760 |
| Square | 230098561 |
| Cube | 3490365071809 |
| Square root | 123.162494 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 40 |
| Scientific notation | 1.5169 × |
15169 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand one hundred and sixty-nine |
| Binary (base 2) | 11101101000001 |
| Octal (base 8) | 35501 |
| Hexadecimal (base 16) | 3B41 |
| Base 3 | 202210211 |
| As time | 15169 seconds = 4 h 12 min 49 s |
Is 15169 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 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 (15169 ÷ 7 = 2167) | 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 4) | 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 | Yes (15169 ÷ 11 = 1379) | 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 15169 a prime number?
No. 15169 = 7 × 11 × 197, so it is divisible by 7.
What are the factors of 15169?
1, 7, 11, 77, 197, 1379, 2167, 15169.
What is 15169 in binary?
11101101000001 (hexadecimal 3B41, octal 35501).
What is the square root of 15169?
About 123.1625.
Is 15169 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 15169?
It is a composite number with 8 divisors.