The number 69150
69150 is a composite number with 24 divisors. Its prime factorisation is 2 × 3 × × 461. Divisors (24): 1, 2, 3, 5, 6, 10, 15, 25, 30, 50, 75, 150, 461, 922, 1383, 2305 … 69150.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
69150 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
69150 is composite. Its prime factorisation is
- 3
The divisors add up to 171864; without 69150 itself that is 102714, so 69150 is abundant (102714 is more than 69150). Euler's totient φ(69150) = 18400 numbers up to 69150 share no factor with it.
- 4
The digits of 69150 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 174 steps to reach 1.
LaTeX source of the formulas on this page
\[ 69150 = 2 \times 3 \times 5^{2} \times 461 \]69150 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 171864 |
| Euler totient φ(n) | 18400 |
| Square | 4781722500 |
| Cube | 330656110875000 |
| Square root | 262.963876 (= 5√2766) |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 174 |
| Scientific notation | 6.915 × |
69150 in other forms
| Form | Value |
|---|---|
| In words | sixty-nine thousand one hundred and fifty |
| Binary (base 2) | 10000111000011110 |
| Octal (base 8) | 207036 |
| Hexadecimal (base 16) | 10E1E |
| Base 3 | 10111212010 |
| As time | 69150 seconds = 19 h 12 min 30 s |
Is 69150 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (69150 ÷ 2 = 34575) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (69150 ÷ 3 = 23050) | 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 (69150 ÷ 5 = 13830) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (69150 ÷ 6 = 11525) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (69150 ÷ 10 = 6915) | 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 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 69150 a prime number?
No. 69150 = 2 × 3 × × 461, so it is divisible by 2.
What are the factors of 69150?
1, 2, 3, 5, 6, 10, 15, 25, 30, 50, 75, 150, 461, 922, 1383, 2305, 2766, 4610, 6915, 11525, 13830, 23050, 34575, 69150.
What is 69150 in binary?
10000111000011110 (hexadecimal 10E1E, octal 207036).
What is the square root of 69150?
About 262.9639, exactly 5√2766.
Is 69150 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 69150?
It is a composite number with 24 divisors.