The number 47613
47613 is a composite number with 8 divisors. Its prime factorisation is 3 × 59 × 269. Divisors (8): 1, 3, 59, 177, 269, 807, 15871, 47613.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
47613 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
47613 is composite. Its prime factorisation is
- 3
The divisors add up to 64800; without 47613 itself that is 17187, so 47613 is deficient (17187 is less than 47613). Euler's totient φ(47613) = 31088 numbers up to 47613 share no factor with it.
- 4
The digits of 47613 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 127 steps to reach 1.
LaTeX source of the formulas on this page
\[ 47613 = 3 \times 59 \times 269 \]
47613 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 64800 |
| Euler totient φ(n) | 31088 |
| Square | 2266997769 |
| Cube | 107938564775397 |
| Square root | 218.204033 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 127 |
| Scientific notation | 4.7613 × |
47613 in other forms
| Form | Value |
|---|---|
| In words | forty-seven thousand six hundred and thirteen |
| Binary (base 2) | 1011100111111101 |
| Octal (base 8) | 134775 |
| Hexadecimal (base 16) | B9FD |
| Base 3 | 2102022110 |
| As time | 47613 seconds = 13 h 13 min 33 s |
Is 47613 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 (47613 ÷ 3 = 15871) | 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 3) | 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 | No (remainder 6) | 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 5) | 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 3) | 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 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 47613 a prime number?
No. 47613 = 3 × 59 × 269, so it is divisible by 3.
What are the factors of 47613?
1, 3, 59, 177, 269, 807, 15871, 47613.
What is 47613 in binary?
1011100111111101 (hexadecimal B9FD, octal 134775).
What is the square root of 47613?
About 218.2040.
Is 47613 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 47613?
It is a composite number with 8 divisors.