The number 45695
45695 is a composite number with 16 divisors. Its prime factorisation is 5 × 13 × 19 × 37. Divisors (16): 1, 5, 13, 19, 37, 65, 95, 185, 247, 481, 703, 1235, 2405, 3515, 9139, 45695.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
45695 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
45695 is composite. Its prime factorisation is
- 3
The divisors add up to 63840; without 45695 itself that is 18145, so 45695 is deficient (18145 is less than 45695). Euler's totient φ(45695) = 31104 numbers up to 45695 share no factor with it.
- 4
The digits of 45695 add up to 29, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 207 steps to reach 1.
LaTeX source of the formulas on this page
\[ 45695 = 5 \times 13 \times 19 \times 37 \]
45695 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 63840 |
| Euler totient φ(n) | 31104 |
| Square | 2088033025 |
| Cube | 95412669077375 |
| Square root | 213.763888 |
| Digit sum / digital root | 29 / 2 |
| Collatz steps to 1 | 207 |
| Scientific notation | 4.5695 × |
45695 in other forms
| Form | Value |
|---|---|
| In words | forty-five thousand six hundred and ninety-five |
| Binary (base 2) | 1011001001111111 |
| Octal (base 8) | 131177 |
| Hexadecimal (base 16) | B27F |
| Base 3 | 2022200102 |
| As time | 45695 seconds = 12 h 41 min 35 s |
Is 45695 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 | Yes (45695 ÷ 5 = 9139) | 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 6) | 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 5) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | 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 45695 a prime number?
No. 45695 = 5 × 13 × 19 × 37, so it is divisible by 5.
What are the factors of 45695?
1, 5, 13, 19, 37, 65, 95, 185, 247, 481, 703, 1235, 2405, 3515, 9139, 45695.
What is 45695 in binary?
1011001001111111 (hexadecimal B27F, octal 131177).
What is the square root of 45695?
About 213.7639.
Is 45695 divisible by 3?
No. Its digits add up to 29, which is not a multiple of 3.
What is special about the number 45695?
It is a composite number with 16 divisors.