The number 69950
69950 is a composite number with 12 divisors. Its prime factorisation is 2 × × 1399. Divisors (12): 1, 2, 5, 10, 25, 50, 1399, 2798, 6995, 13990, 34975, 69950.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
69950 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
69950 is composite. Its prime factorisation is
- 3
The divisors add up to 130200; without 69950 itself that is 60250, so 69950 is deficient (60250 is less than 69950). Euler's totient φ(69950) = 27960 numbers up to 69950 share no factor with it.
- 4
The digits of 69950 add up to 29, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 112 steps to reach 1.
LaTeX source of the formulas on this page
\[ 69950 = 2 \times 5^{2} \times 1399 \]69950 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 130200 |
| Euler totient φ(n) | 27960 |
| Square | 4893002500 |
| Cube | 342265524875000 |
| Square root | 264.480623 (= 5√2798) |
| Digit sum / digital root | 29 / 2 |
| Collatz steps to 1 | 112 |
| Scientific notation | 6.995 × |
69950 in other forms
| Form | Value |
|---|---|
| In words | sixty-nine thousand nine hundred and fifty |
| Binary (base 2) | 10001000100111110 |
| Octal (base 8) | 210476 |
| Hexadecimal (base 16) | 1113E |
| Base 3 | 10112221202 |
| As time | 69950 seconds = 19 h 25 min 50 s |
Is 69950 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (69950 ÷ 2 = 34975) | 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 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (69950 ÷ 5 = 13990) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 6) | 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 | Yes (69950 ÷ 10 = 6995) | 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 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 69950 a prime number?
No. 69950 = 2 × × 1399, so it is divisible by 2.
What are the factors of 69950?
1, 2, 5, 10, 25, 50, 1399, 2798, 6995, 13990, 34975, 69950.
What is 69950 in binary?
10001000100111110 (hexadecimal 1113E, octal 210476).
What is the square root of 69950?
About 264.4806, exactly 5√2798.
Is 69950 divisible by 3?
No. Its digits add up to 29, which is not a multiple of 3.
What is special about the number 69950?
It is a composite number with 12 divisors.