The number 46815
46815 is a composite number with 8 divisors. Its prime factorisation is 3 × 5 × 3121. Divisors (8): 1, 3, 5, 15, 3121, 9363, 15605, 46815.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
46815 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
46815 is composite. Its prime factorisation is
- 3
The divisors add up to 74928; without 46815 itself that is 28113, so 46815 is deficient (28113 is less than 46815). Euler's totient φ(46815) = 24960 numbers up to 46815 share no factor with it.
- 4
The digits of 46815 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 176 steps to reach 1.
LaTeX source of the formulas on this page
\[ 46815 = 3 \times 5 \times 3121 \]
46815 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 74928 |
| Euler totient φ(n) | 24960 |
| Square | 2191644225 |
| Cube | 102601824393375 |
| Square root | 216.367743 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 176 |
| Scientific notation | 4.6815 × |
46815 in other forms
| Form | Value |
|---|---|
| In words | forty-six thousand eight hundred and fifteen |
| Binary (base 2) | 1011011011011111 |
| Octal (base 8) | 133337 |
| Hexadecimal (base 16) | B6DF |
| Base 3 | 2101012220 |
| As time | 46815 seconds = 13 h 0 min 15 s |
Is 46815 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 (46815 ÷ 3 = 15605) | 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 (46815 ÷ 5 = 9363) | 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 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 6) | 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 10) | 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 46815 a prime number?
No. 46815 = 3 × 5 × 3121, so it is divisible by 3.
What are the factors of 46815?
1, 3, 5, 15, 3121, 9363, 15605, 46815.
What is 46815 in binary?
1011011011011111 (hexadecimal B6DF, octal 133337).
What is the square root of 46815?
About 216.3677.
Is 46815 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 46815?
It is a composite number with 8 divisors.