The number 48207
48207 is a composite number with 4 divisors. Its prime factorisation is 3 × 16069. Divisors (4): 1, 3, 16069, 48207.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 48207: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 3 × 16069, the product of two primes.
- 2
48207 is composite. Its prime factorisation is
- 3
The divisors add up to 64280; without 48207 itself that is 16073, so 48207 is deficient (16073 is less than 48207). Euler's totient φ(48207) = 32136 numbers up to 48207 share no factor with it.
- 4
The digits of 48207 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 44 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48207 = 3 \times 16069 \]
48207 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 64280 |
| Euler totient φ(n) | 32136 |
| Square | 2323914849 |
| Cube | 112028963125743 |
| Square root | 219.560925 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 44 |
| Scientific notation | 4.8207 × |
48207 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand two hundred and seven |
| Binary (base 2) | 1011110001001111 |
| Octal (base 8) | 136117 |
| Hexadecimal (base 16) | BC4F |
| Base 3 | 2110010110 |
| As time | 48207 seconds = 13 h 23 min 27 s |
Is 48207 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 (48207 ÷ 3 = 16069) | 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 2) | 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 5) | 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 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 7) | 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 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 48207 a prime number?
No. 48207 = 3 × 16069, so it is divisible by 3.
What are the factors of 48207?
1, 3, 16069, 48207.
What is 48207 in binary?
1011110001001111 (hexadecimal BC4F, octal 136117).
What is the square root of 48207?
About 219.5609.
Is 48207 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 48207?
48207 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 3 × 16069, the product of two primes.