The number 48269
48269 is a composite number with 8 divisors. Its prime factorisation is 13 × 47 × 79. Divisors (8): 1, 13, 47, 79, 611, 1027, 3713, 48269.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
48269 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
48269 is composite. Its prime factorisation is
- 3
The divisors add up to 53760; without 48269 itself that is 5491, so 48269 is deficient (5491 is less than 48269). Euler's totient φ(48269) = 43056 numbers up to 48269 share no factor with it.
- 4
The digits of 48269 add up to 29, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 44 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48269 = 13 \times 47 \times 79 \]
48269 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 53760 |
| Euler totient φ(n) | 43056 |
| Square | 2329896361 |
| Cube | 112461767449109 |
| Square root | 219.702071 |
| Digit sum / digital root | 29 / 2 |
| Collatz steps to 1 | 44 |
| Scientific notation | 4.8269 × |
48269 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand two hundred and sixty-nine |
| Binary (base 2) | 1011110010001101 |
| Octal (base 8) | 136215 |
| Hexadecimal (base 16) | BC8D |
| Base 3 | 2110012202 |
| As time | 48269 seconds = 13 h 24 min 29 s |
Is 48269 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 4) | 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 4) | 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 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 9) | 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 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 48269 a prime number?
No. 48269 = 13 × 47 × 79, so it is divisible by 13.
What are the factors of 48269?
1, 13, 47, 79, 611, 1027, 3713, 48269.
What is 48269 in binary?
1011110010001101 (hexadecimal BC8D, octal 136215).
What is the square root of 48269?
About 219.7021.
Is 48269 divisible by 3?
No. Its digits add up to 29, which is not a multiple of 3.
What is special about the number 48269?
It is a composite number with 8 divisors.