The number 48071
48071 is a composite number with 4 divisors. Its prime factorisation is 53 × 907. Divisors (4): 1, 53, 907, 48071.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 48071: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 53 × 907, the product of two primes.
- 2
48071 is composite. Its prime factorisation is
- 3
The divisors add up to 49032; without 48071 itself that is 961, so 48071 is deficient (961 is less than 48071). Euler's totient φ(48071) = 47112 numbers up to 48071 share no factor with it.
- 4
The digits of 48071 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 70 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48071 = 53 \times 907 \]
48071 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 49032 |
| Euler totient φ(n) | 47112 |
| Square | 2310821041 |
| Cube | 111083478261911 |
| Square root | 219.250998 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 70 |
| Scientific notation | 4.8071 × |
48071 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand and seventy-one |
| Binary (base 2) | 1011101111000111 |
| Octal (base 8) | 135707 |
| Hexadecimal (base 16) | BBC7 |
| Base 3 | 2102221102 |
| As time | 48071 seconds = 13 h 21 min 11 s |
Is 48071 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 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 | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | 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 1) | 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 48071 a prime number?
No. 48071 = 53 × 907, so it is divisible by 53.
What are the factors of 48071?
1, 53, 907, 48071.
What is 48071 in binary?
1011101111000111 (hexadecimal BBC7, octal 135707).
What is the square root of 48071?
About 219.2510.
Is 48071 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 48071?
48071 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 53 × 907, the product of two primes.