The number 46915
46915 is a composite number with 8 divisors. Its prime factorisation is 5 × 11 × 853. Divisors (8): 1, 5, 11, 55, 853, 4265, 9383, 46915.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
46915 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
46915 is composite. Its prime factorisation is
- 3
The divisors add up to 61488; without 46915 itself that is 14573, so 46915 is deficient (14573 is less than 46915). Euler's totient φ(46915) = 34080 numbers up to 46915 share no factor with it.
- 4
The digits of 46915 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 251 steps to reach 1.
LaTeX source of the formulas on this page
\[ 46915 = 5 \times 11 \times 853 \]
46915 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 61488 |
| Euler totient φ(n) | 34080 |
| Square | 2201017225 |
| Cube | 103260723110875 |
| Square root | 216.598707 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 251 |
| Scientific notation | 4.6915 × |
46915 in other forms
| Form | Value |
|---|---|
| In words | forty-six thousand nine hundred and fifteen |
| Binary (base 2) | 1011011101000011 |
| Octal (base 8) | 133503 |
| Hexadecimal (base 16) | B743 |
| Base 3 | 2101100121 |
| As time | 46915 seconds = 13 h 1 min 55 s |
Is 46915 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 (46915 ÷ 5 = 9383) | 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 1) | 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 7) | 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 | Yes (46915 ÷ 11 = 4265) | 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 46915 a prime number?
No. 46915 = 5 × 11 × 853, so it is divisible by 5.
What are the factors of 46915?
1, 5, 11, 55, 853, 4265, 9383, 46915.
What is 46915 in binary?
1011011101000011 (hexadecimal B743, octal 133503).
What is the square root of 46915?
About 216.5987.
Is 46915 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 46915?
It is a composite number with 8 divisors.