The number 15167
15167 is a composite number with 4 divisors. Its prime factorisation is 29 × 523. Divisors (4): 1, 29, 523, 15167.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 15167: a semiprime: 29 × 523, the product of two primes.
- 2
15167 is composite. Its prime factorisation is
- 3
The divisors add up to 15720; without 15167 itself that is 553, so 15167 is deficient (553 is less than 15167). Euler's totient φ(15167) = 14616 numbers up to 15167 share no factor with it.
- 4
The digits of 15167 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 84 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15167 = 29 \times 523 \]
15167 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 15720 |
| Euler totient φ(n) | 14616 |
| Square | 230037889 |
| Cube | 3488984662463 |
| Square root | 123.154375 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 84 |
| Scientific notation | 1.5167 × |
15167 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand one hundred and sixty-seven |
| Binary (base 2) | 11101100111111 |
| Octal (base 8) | 35477 |
| Hexadecimal (base 16) | 3B3F |
| Base 3 | 202210202 |
| As time | 15167 seconds = 4 h 12 min 47 s |
Is 15167 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 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | 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 5) | 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 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 7) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 15167 a prime number?
No. 15167 = 29 × 523, so it is divisible by 29.
What are the factors of 15167?
1, 29, 523, 15167.
What is 15167 in binary?
11101100111111 (hexadecimal 3B3F, octal 35477).
What is the square root of 15167?
About 123.1544.
Is 15167 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 15167?
15167 is a semiprime: 29 × 523, the product of two primes.