The number 46315
46315 is a composite number with 8 divisors. Its prime factorisation is 5 × 59 × 157. Divisors (8): 1, 5, 59, 157, 295, 785, 9263, 46315.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
46315 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
46315 is composite. Its prime factorisation is
- 3
The divisors add up to 56880; without 46315 itself that is 10565, so 46315 is deficient (10565 is less than 46315). Euler's totient φ(46315) = 36192 numbers up to 46315 share no factor with it.
- 4
The digits of 46315 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 114 steps to reach 1.
LaTeX source of the formulas on this page
\[ 46315 = 5 \times 59 \times 157 \]
46315 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 56880 |
| Euler totient φ(n) | 36192 |
| Square | 2145079225 |
| Cube | 99349344305875 |
| Square root | 215.209201 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 114 |
| Scientific notation | 4.6315 × |
46315 in other forms
| Form | Value |
|---|---|
| In words | forty-six thousand three hundred and fifteen |
| Binary (base 2) | 1011010011101011 |
| Octal (base 8) | 132353 |
| Hexadecimal (base 16) | B4EB |
| Base 3 | 2100112101 |
| As time | 46315 seconds = 12 h 51 min 55 s |
Is 46315 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 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (46315 ÷ 5 = 9263) | 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 | No (remainder 3) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | 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 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 46315 a prime number?
No. 46315 = 5 × 59 × 157, so it is divisible by 5.
What are the factors of 46315?
1, 5, 59, 157, 295, 785, 9263, 46315.
What is 46315 in binary?
1011010011101011 (hexadecimal B4EB, octal 132353).
What is the square root of 46315?
About 215.2092.
Is 46315 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 46315?
It is a composite number with 8 divisors.