The number 5069
5069 is a composite number with 4 divisors. Its prime factorisation is 37 × 137. Divisors (4): 1, 37, 137, 5069.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 5069: a semiprime: 37 × 137, the product of two primes.
- 2
5069 is composite. Its prime factorisation is
- 3
The divisors add up to 5244; without 5069 itself that is 175, so 5069 is deficient (175 is less than 5069). Euler's totient φ(5069) = 4896 numbers up to 5069 share no factor with it.
- 4
The digits of 5069 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 33 steps to reach 1.
LaTeX source of the formulas on this page
\[ 5069 = 37 \times 137 \]
5069 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 5244 |
| Euler totient φ(n) | 4896 |
| Square | 25694761 |
| Cube | 130246743509 |
| Square root | 71.196910 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 33 |
| Scientific notation | 5.069 × |
5069 in other forms
| Form | Value |
|---|---|
| In words | five thousand and sixty-nine |
| Binary (base 2) | 1001111001101 |
| Octal (base 8) | 11715 |
| Hexadecimal (base 16) | 13CD |
| Base 3 | 20221202 |
| As time | 5069 seconds = 1 h 24 min 29 s |
Is 5069 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 2) | 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 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 2) | 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 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 5069 a prime number?
No. 5069 = 37 × 137, so it is divisible by 37.
What are the factors of 5069?
1, 37, 137, 5069.
What is 5069 in binary?
1001111001101 (hexadecimal 13CD, octal 11715).
What is the square root of 5069?
About 71.1969.
Is 5069 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 5069?
5069 is a semiprime: 37 × 137, the product of two primes.