The number 48451
48451 is a composite number with 4 divisors. Its prime factorisation is 13 × 3727. Divisors (4): 1, 13, 3727, 48451.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 48451: a semiprime: 13 × 3727, the product of two primes.
- 2
48451 is composite. Its prime factorisation is
- 3
The divisors add up to 52192; without 48451 itself that is 3741, so 48451 is deficient (3741 is less than 48451). Euler's totient φ(48451) = 44712 numbers up to 48451 share no factor with it.
- 4
The digits of 48451 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 70 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48451 = 13 \times 3727 \]
48451 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 52192 |
| Euler totient φ(n) | 44712 |
| Square | 2347499401 |
| Cube | 113738693477851 |
| Square root | 220.115879 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 70 |
| Scientific notation | 4.8451 × |
48451 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand four hundred and fifty-one |
| Binary (base 2) | 1011110101000011 |
| Octal (base 8) | 136503 |
| Hexadecimal (base 16) | BD43 |
| Base 3 | 2110110111 |
| As time | 48451 seconds = 13 h 27 min 31 s |
Is 48451 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 | No (remainder 1) | 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 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | 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 7) | 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 48451 a prime number?
No. 48451 = 13 × 3727, so it is divisible by 13.
What are the factors of 48451?
1, 13, 3727, 48451.
What is 48451 in binary?
1011110101000011 (hexadecimal BD43, octal 136503).
What is the square root of 48451?
About 220.1159.
Is 48451 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 48451?
48451 is a semiprime: 13 × 3727, the product of two primes.