The number 4361
4361 is a composite number with 6 divisors. Its prime factorisation is Ć 89. Divisors (6): 1, 7, 49, 89, 623, 4361.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
4361 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
4361 is composite. Its prime factorisation is
- 3
The divisors add up to 5130; without 4361 itself that is 769, so 4361 is deficient (769 is less than 4361). Euler's totient Ļ(4361) = 3696 numbers up to 4361 share no factor with it.
- 4
The digits of 4361 add up to 14, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 139 steps to reach 1.
LaTeX source of the formulas on this page
\[ 4361 = 7^{2} \times 89 \]4361 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 5130 |
| Euler totient Ļ(n) | 3696 |
| Square | 19018321 |
| Cube | 82938897881 |
| Square root | 66.037868 (= 7ā89) |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 139 |
| Scientific notation | 4.361 Ć |
4361 in other forms
| Form | Value |
|---|---|
| In words | four thousand three hundred and sixty-one |
| Binary (base 2) | 1000100001001 |
| Octal (base 8) | 10411 |
| Hexadecimal (base 16) | 1109 |
| Base 3 | 12222112 |
| As time | 4361 seconds = 1 h 12 min 41 s |
Is 4361 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 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 1) | 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 (4361 Ć· 7 = 623) | 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 1) | 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 1) | 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 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 4361 a prime number?
No. 4361 = Ć 89, so it is divisible by 7.
What are the factors of 4361?
1, 7, 49, 89, 623, 4361.
What is 4361 in binary?
1000100001001 (hexadecimal 1109, octal 10411).
What is the square root of 4361?
About 66.0379, exactly 7ā89.
Is 4361 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 4361?
It is a composite number with 6 divisors.