The number 39153
39153 is a composite number with 8 divisors. Its prime factorisation is 3 × 31 × 421. Divisors (8): 1, 3, 31, 93, 421, 1263, 13051, 39153.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
39153 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
39153 is composite. Its prime factorisation is
- 3
The divisors add up to 54016; without 39153 itself that is 14863, so 39153 is deficient (14863 is less than 39153). Euler's totient φ(39153) = 25200 numbers up to 39153 share no factor with it.
- 4
The digits of 39153 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 137 steps to reach 1.
LaTeX source of the formulas on this page
\[ 39153 = 3 \times 31 \times 421 \]
39153 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 54016 |
| Euler totient φ(n) | 25200 |
| Square | 1532957409 |
| Cube | 60019881434577 |
| Square root | 197.871170 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 137 |
| Scientific notation | 3.9153 × |
39153 in other forms
| Form | Value |
|---|---|
| In words | thirty-nine thousand one hundred and fifty-three |
| Binary (base 2) | 1001100011110001 |
| Octal (base 8) | 114361 |
| Hexadecimal (base 16) | 98F1 |
| Base 3 | 1222201010 |
| As time | 39153 seconds = 10 h 52 min 33 s |
Is 39153 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 (39153 ÷ 3 = 13051) | 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 3) | 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 1) | 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 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 39153 a prime number?
No. 39153 = 3 × 31 × 421, so it is divisible by 3.
What are the factors of 39153?
1, 3, 31, 93, 421, 1263, 13051, 39153.
What is 39153 in binary?
1001100011110001 (hexadecimal 98F1, octal 114361).
What is the square root of 39153?
About 197.8712.
Is 39153 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 39153?
It is a composite number with 8 divisors.