The number 47035
47035 is a composite number with 8 divisors. Its prime factorisation is 5 × 23 × 409. Divisors (8): 1, 5, 23, 115, 409, 2045, 9407, 47035.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
47035 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
47035 is composite. Its prime factorisation is
- 3
The divisors add up to 59040; without 47035 itself that is 12005, so 47035 is deficient (12005 is less than 47035). Euler's totient φ(47035) = 35904 numbers up to 47035 share no factor with it.
- 4
The digits of 47035 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 145 steps to reach 1.
LaTeX source of the formulas on this page
\[ 47035 = 5 \times 23 \times 409 \]
47035 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 59040 |
| Euler totient φ(n) | 35904 |
| Square | 2212291225 |
| Cube | 104055117767875 |
| Square root | 216.875540 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 145 |
| Scientific notation | 4.7035 × |
47035 in other forms
| Form | Value |
|---|---|
| In words | forty-seven thousand and thirty-five |
| Binary (base 2) | 1011011110111011 |
| Octal (base 8) | 133673 |
| Hexadecimal (base 16) | B7BB |
| Base 3 | 2101112001 |
| As time | 47035 seconds = 13 h 3 min 55 s |
Is 47035 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 (47035 ÷ 5 = 9407) | 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 2) | 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 3) | 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 10) | 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 47035 a prime number?
No. 47035 = 5 × 23 × 409, so it is divisible by 5.
What are the factors of 47035?
1, 5, 23, 115, 409, 2045, 9407, 47035.
What is 47035 in binary?
1011011110111011 (hexadecimal B7BB, octal 133673).
What is the square root of 47035?
About 216.8755.
Is 47035 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 47035?
It is a composite number with 8 divisors.