The number 39007
39007 is a composite number with 4 divisors. Its prime factorisation is 19 × 2053. Divisors (4): 1, 19, 2053, 39007.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 39007: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 19; a semiprime: 19 × 2053, the product of two primes.
- 2
39007 is composite. Its prime factorisation is
- 3
The divisors add up to 41080; without 39007 itself that is 2073, so 39007 is deficient (2073 is less than 39007). Euler's totient φ(39007) = 36936 numbers up to 39007 share no factor with it.
- 4
The digits of 39007 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 124 steps to reach 1.
LaTeX source of the formulas on this page
\[ 39007 = 19 \times 2053 \]
39007 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 41080 |
| Euler totient φ(n) | 36936 |
| Square | 1521546049 |
| Cube | 59350946733343 |
| Square root | 197.501899 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 124 |
| Scientific notation | 3.9007 × |
39007 in other forms
| Form | Value |
|---|---|
| In words | thirty-nine thousand and seven |
| Binary (base 2) | 1001100001011111 |
| Octal (base 8) | 114137 |
| Hexadecimal (base 16) | 985F |
| Base 3 | 1222111201 |
| As time | 39007 seconds = 10 h 50 min 7 s |
Is 39007 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 2) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | 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 1) | 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 39007 a prime number?
No. 39007 = 19 × 2053, so it is divisible by 19.
What are the factors of 39007?
1, 19, 2053, 39007.
What is 39007 in binary?
1001100001011111 (hexadecimal 985F, octal 114137).
What is the square root of 39007?
About 197.5019.
Is 39007 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 39007?
39007 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 19; a semiprime: 19 × 2053, the product of two primes.