The number 28695
28695 is a composite number with 8 divisors. Its prime factorisation is 3 × 5 × 1913. Divisors (8): 1, 3, 5, 15, 1913, 5739, 9565, 28695.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
28695 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
28695 is composite. Its prime factorisation is
- 3
The divisors add up to 45936; without 28695 itself that is 17241, so 28695 is deficient (17241 is less than 28695). Euler's totient φ(28695) = 15296 numbers up to 28695 share no factor with it.
- 4
The digits of 28695 add up to 30, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 77 steps to reach 1.
LaTeX source of the formulas on this page
\[ 28695 = 3 \times 5 \times 1913 \]
28695 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 45936 |
| Euler totient φ(n) | 15296 |
| Square | 823403025 |
| Cube | 23627549802375 |
| Square root | 169.395986 |
| Digit sum / digital root | 30 / 3 |
| Collatz steps to 1 | 77 |
| Scientific notation | 2.8695 × |
28695 in other forms
| Form | Value |
|---|---|
| In words | twenty-eight thousand six hundred and ninety-five |
| Binary (base 2) | 111000000010111 |
| Octal (base 8) | 70027 |
| Hexadecimal (base 16) | 7017 |
| Base 3 | 1110100210 |
| As time | 28695 seconds = 7 h 58 min 15 s |
Is 28695 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 | Yes (28695 ÷ 3 = 9565) | 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 | Yes (28695 ÷ 5 = 5739) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 5) | 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 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 28695 a prime number?
No. 28695 = 3 × 5 × 1913, so it is divisible by 3.
What are the factors of 28695?
1, 3, 5, 15, 1913, 5739, 9565, 28695.
What is 28695 in binary?
111000000010111 (hexadecimal 7017, octal 70027).
What is the square root of 28695?
About 169.3960.
Is 28695 divisible by 3?
Yes. Its digits add up to 30, a multiple of 3.
What is special about the number 28695?
It is a composite number with 8 divisors.