The number 56399
56399 is a composite number with 6 divisors. Its prime factorisation is Ć 1151. Divisors (6): 1, 7, 49, 1151, 8057, 56399.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
56399 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
56399 is composite. Its prime factorisation is
- 3
The divisors add up to 65664; without 56399 itself that is 9265, so 56399 is deficient (9265 is less than 56399). Euler's totient Ļ(56399) = 48300 numbers up to 56399 share no factor with it.
- 4
The digits of 56399 add up to 32, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 109 steps to reach 1.
LaTeX source of the formulas on this page
\[ 56399 = 7^{2} \times 1151 \]56399 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 65664 |
| Euler totient Ļ(n) | 48300 |
| Square | 3180847201 |
| Cube | 179396601289199 |
| Square root | 237.484736 (= 7ā1151) |
| Digit sum / digital root | 32 / 5 |
| Collatz steps to 1 | 109 |
| Scientific notation | 5.6399 Ć |
56399 in other forms
| Form | Value |
|---|---|
| In words | fifty-six thousand three hundred and ninety-nine |
| Binary (base 2) | 1101110001001111 |
| Octal (base 8) | 156117 |
| Hexadecimal (base 16) | DC4F |
| Base 3 | 2212100212 |
| As time | 56399 seconds = 15 h 39 min 59 s |
Is 56399 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 2) | 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 | No (remainder 4) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (56399 Ć· 7 = 8057) | 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 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 56399 a prime number?
No. 56399 = Ć 1151, so it is divisible by 7.
What are the factors of 56399?
1, 7, 49, 1151, 8057, 56399.
What is 56399 in binary?
1101110001001111 (hexadecimal DC4F, octal 156117).
What is the square root of 56399?
About 237.4847, exactly 7ā1151.
Is 56399 divisible by 3?
No. Its digits add up to 32, which is not a multiple of 3.
What is special about the number 56399?
It is a composite number with 6 divisors.