The number 61215
61215 is a composite number with 32 divisors. Its prime factorisation is 3 × 5 × 7 × 11 × 53. Divisors (32): 1, 3, 5, 7, 11, 15, 21, 33, 35, 53, 55, 77, 105, 159, 165, 231 … 61215.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 61215: a Harshad number: divisible by its digit sum 15.
- 2
61215 is composite. Its prime factorisation is
- 3
The divisors add up to 124416; without 61215 itself that is 63201, so 61215 is abundant (63201 is more than 61215). Euler's totient φ(61215) = 24960 numbers up to 61215 share no factor with it.
- 4
The digits of 61215 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 179 steps to reach 1.
LaTeX source of the formulas on this page
\[ 61215 = 3 \times 5 \times 7 \times 11 \times 53 \]
61215 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 124416 |
| Euler totient φ(n) | 24960 |
| Square | 3747276225 |
| Cube | 229389514113375 |
| Square root | 247.416653 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 179 |
| Scientific notation | 6.1215 × |
61215 in other forms
| Form | Value |
|---|---|
| In words | sixty-one thousand two hundred and fifteen |
| Binary (base 2) | 1110111100011111 |
| Octal (base 8) | 167437 |
| Hexadecimal (base 16) | EF1F |
| Base 3 | 10002222020 |
| As time | 61215 seconds = 17 h 0 min 15 s |
Is 61215 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 (61215 ÷ 3 = 20405) | 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 (61215 ÷ 5 = 12243) | 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 (61215 ÷ 7 = 8745) | 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 | Yes (61215 ÷ 11 = 5565) | 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 61215 a prime number?
No. 61215 = 3 × 5 × 7 × 11 × 53, so it is divisible by 3.
What are the factors of 61215?
1, 3, 5, 7, 11, 15, 21, 33, 35, 53, 55, 77, 105, 159, 165, 231, 265, 371, 385, 583, 795, 1113, 1155, 1749, 1855, 2915, 4081, 5565, 8745, 12243, 20405, 61215.
What is 61215 in binary?
1110111100011111 (hexadecimal EF1F, octal 167437).
What is the square root of 61215?
About 247.4167.
Is 61215 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 61215?
61215 is a Harshad number: divisible by its digit sum 15.