The number 46295
46295 is a composite number with 8 divisors. Its prime factorisation is 5 × 47 × 197. Divisors (8): 1, 5, 47, 197, 235, 985, 9259, 46295.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
46295 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
46295 is composite. Its prime factorisation is
- 3
The divisors add up to 57024; without 46295 itself that is 10729, so 46295 is deficient (10729 is less than 46295). Euler's totient φ(46295) = 36064 numbers up to 46295 share no factor with it.
- 4
The digits of 46295 add up to 26, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 145 steps to reach 1.
LaTeX source of the formulas on this page
\[ 46295 = 5 \times 47 \times 197 \]
46295 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 57024 |
| Euler totient φ(n) | 36064 |
| Square | 2143227025 |
| Cube | 99220695122375 |
| Square root | 215.162729 |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 145 |
| Scientific notation | 4.6295 × |
46295 in other forms
| Form | Value |
|---|---|
| In words | forty-six thousand two hundred and ninety-five |
| Binary (base 2) | 1011010011010111 |
| Octal (base 8) | 132327 |
| Hexadecimal (base 16) | B4D7 |
| Base 3 | 2100111122 |
| As time | 46295 seconds = 12 h 51 min 35 s |
Is 46295 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 (46295 ÷ 5 = 9259) | 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 4) | 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 8) | 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 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 46295 a prime number?
No. 46295 = 5 × 47 × 197, so it is divisible by 5.
What are the factors of 46295?
1, 5, 47, 197, 235, 985, 9259, 46295.
What is 46295 in binary?
1011010011010111 (hexadecimal B4D7, octal 132327).
What is the square root of 46295?
About 215.1627.
Is 46295 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 46295?
It is a composite number with 8 divisors.