The number 48373
48373 is a composite number with 6 divisors. Its prime factorisation is 13 Ć . Divisors (6): 1, 13, 61, 793, 3721, 48373.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
48373 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
48373 is composite. Its prime factorisation is
- 3
The divisors add up to 52962; without 48373 itself that is 4589, so 48373 is deficient (4589 is less than 48373). Euler's totient Ļ(48373) = 43920 numbers up to 48373 share no factor with it.
- 4
The digits of 48373 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 96 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48373 = 13 \times 61^{2} \]48373 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 52962 |
| Euler totient Ļ(n) | 43920 |
| Square | 2339947129 |
| Cube | 113190262471117 |
| Square root | 219.938628 (= 61ā13) |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 96 |
| Scientific notation | 4.8373 Ć |
48373 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand three hundred and seventy-three |
| Binary (base 2) | 1011110011110101 |
| Octal (base 8) | 136365 |
| Hexadecimal (base 16) | BCF5 |
| Base 3 | 2110100121 |
| As time | 48373 seconds = 13 h 26 min 13 s |
Is 48373 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 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | 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 3) | 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 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 48373 a prime number?
No. 48373 = 13 Ć , so it is divisible by 13.
What are the factors of 48373?
1, 13, 61, 793, 3721, 48373.
What is 48373 in binary?
1011110011110101 (hexadecimal BCF5, octal 136365).
What is the square root of 48373?
About 219.9386, exactly 61ā13.
Is 48373 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 48373?
It is a composite number with 6 divisors.