The number 46515
46515 is a composite number with 16 divisors. Its prime factorisation is 3 × 5 × 7 × 443. Divisors (16): 1, 3, 5, 7, 15, 21, 35, 105, 443, 1329, 2215, 3101, 6645, 9303, 15505, 46515.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 46515: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 21.
- 2
46515 is composite. Its prime factorisation is
- 3
The divisors add up to 85248; without 46515 itself that is 38733, so 46515 is deficient (38733 is less than 46515). Euler's totient φ(46515) = 21216 numbers up to 46515 share no factor with it.
- 4
The digits of 46515 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 52 steps to reach 1.
LaTeX source of the formulas on this page
\[ 46515 = 3 \times 5 \times 7 \times 443 \]
46515 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 85248 |
| Euler totient φ(n) | 21216 |
| Square | 2163645225 |
| Cube | 100641957640875 |
| Square root | 215.673364 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 52 |
| Scientific notation | 4.6515 × |
46515 in other forms
| Form | Value |
|---|---|
| In words | forty-six thousand five hundred and fifteen |
| Binary (base 2) | 1011010110110011 |
| Octal (base 8) | 132663 |
| Hexadecimal (base 16) | B5B3 |
| Base 3 | 2100210210 |
| As time | 46515 seconds = 12 h 55 min 15 s |
Is 46515 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 (46515 ÷ 3 = 15505) | 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 (46515 ÷ 5 = 9303) | 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 | Yes (46515 ÷ 7 = 6645) | 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 3) | 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 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 46515 a prime number?
No. 46515 = 3 × 5 × 7 × 443, so it is divisible by 3.
What are the factors of 46515?
1, 3, 5, 7, 15, 21, 35, 105, 443, 1329, 2215, 3101, 6645, 9303, 15505, 46515.
What is 46515 in binary?
1011010110110011 (hexadecimal B5B3, octal 132663).
What is the square root of 46515?
About 215.6734.
Is 46515 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 46515?
46515 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 21.