The number 56215
56215 is a composite number with 4 divisors. Its prime factorisation is 5 × 11243. Divisors (4): 1, 5, 11243, 56215.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 56215: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 5 × 11243, the product of two primes.
- 2
56215 is composite. Its prime factorisation is
- 3
The divisors add up to 67464; without 56215 itself that is 11249, so 56215 is deficient (11249 is less than 56215). Euler's totient φ(56215) = 44968 numbers up to 56215 share no factor with it.
- 4
The digits of 56215 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 197 steps to reach 1.
LaTeX source of the formulas on this page
\[ 56215 = 5 \times 11243 \]
56215 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 67464 |
| Euler totient φ(n) | 44968 |
| Square | 3160126225 |
| Cube | 177646495738375 |
| Square root | 237.097027 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 197 |
| Scientific notation | 5.6215 × |
56215 in other forms
| Form | Value |
|---|---|
| In words | fifty-six thousand two hundred and fifteen |
| Binary (base 2) | 1101101110010111 |
| Octal (base 8) | 155627 |
| Hexadecimal (base 16) | DB97 |
| Base 3 | 2212010001 |
| As time | 56215 seconds = 15 h 36 min 55 s |
Is 56215 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 (56215 ÷ 5 = 11243) | 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 5) | 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 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 56215 a prime number?
No. 56215 = 5 × 11243, so it is divisible by 5.
What are the factors of 56215?
1, 5, 11243, 56215.
What is 56215 in binary?
1101101110010111 (hexadecimal DB97, octal 155627).
What is the square root of 56215?
About 237.0970.
Is 56215 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 56215?
56215 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 5 × 11243, the product of two primes.