The number 39469
39469 is a composite number with 4 divisors. Its prime factorisation is 29 × 1361. Divisors (4): 1, 29, 1361, 39469.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 39469: a semiprime: 29 × 1361, the product of two primes.
- 2
39469 is composite. Its prime factorisation is
- 3
The divisors add up to 40860; without 39469 itself that is 1391, so 39469 is deficient (1391 is less than 39469). Euler's totient φ(39469) = 38080 numbers up to 39469 share no factor with it.
- 4
The digits of 39469 add up to 31, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 75 steps to reach 1.
LaTeX source of the formulas on this page
\[ 39469 = 29 \times 1361 \]
39469 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 40860 |
| Euler totient φ(n) | 38080 |
| Square | 1557801961 |
| Cube | 61484885598709 |
| Square root | 198.668065 |
| Digit sum / digital root | 31 / 4 |
| Collatz steps to 1 | 75 |
| Scientific notation | 3.9469 × |
39469 in other forms
| Form | Value |
|---|---|
| In words | thirty-nine thousand four hundred and sixty-nine |
| Binary (base 2) | 1001101000101101 |
| Octal (base 8) | 115055 |
| Hexadecimal (base 16) | 9A2D |
| Base 3 | 2000010211 |
| As time | 39469 seconds = 10 h 57 min 49 s |
Is 39469 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 4) | 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 4) | 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 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 39469 a prime number?
No. 39469 = 29 × 1361, so it is divisible by 29.
What are the factors of 39469?
1, 29, 1361, 39469.
What is 39469 in binary?
1001101000101101 (hexadecimal 9A2D, octal 115055).
What is the square root of 39469?
About 198.6681.
Is 39469 divisible by 3?
No. Its digits add up to 31, which is not a multiple of 3.
What is special about the number 39469?
39469 is a semiprime: 29 × 1361, the product of two primes.