The number 69460
69460 is a composite number with 24 divisors. Its prime factorisation is × 5 × 23 × 151. Divisors (24): 1, 2, 4, 5, 10, 20, 23, 46, 92, 115, 151, 230, 302, 460, 604, 755 … 69460.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
69460 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
69460 is composite. Its prime factorisation is
- 3
The divisors add up to 153216; without 69460 itself that is 83756, so 69460 is abundant (83756 is more than 69460). Euler's totient φ(69460) = 26400 numbers up to 69460 share no factor with it.
- 4
The digits of 69460 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 50 steps to reach 1.
LaTeX source of the formulas on this page
\[ 69460 = 2^{2} \times 5 \times 23 \times 151 \]69460 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 153216 |
| Euler totient φ(n) | 26400 |
| Square | 4824691600 |
| Cube | 335123078536000 |
| Square root | 263.552651 (= 2√17365) |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 50 |
| Scientific notation | 6.946 × |
69460 in other forms
| Form | Value |
|---|---|
| In words | sixty-nine thousand four hundred and sixty |
| Binary (base 2) | 10000111101010100 |
| Octal (base 8) | 207524 |
| Hexadecimal (base 16) | 10F54 |
| Base 3 | 10112021121 |
| As time | 69460 seconds = 19 h 17 min 40 s |
Is 69460 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (69460 ÷ 2 = 34730) | 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 | Yes (69460 ÷ 4 = 17365) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (69460 ÷ 5 = 13892) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (69460 ÷ 10 = 6946) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 69460 a prime number?
No. 69460 = × 5 × 23 × 151, so it is divisible by 2.
What are the factors of 69460?
1, 2, 4, 5, 10, 20, 23, 46, 92, 115, 151, 230, 302, 460, 604, 755, 1510, 3020, 3473, 6946, 13892, 17365, 34730, 69460.
What is 69460 in binary?
10000111101010100 (hexadecimal 10F54, octal 207524).
What is the square root of 69460?
About 263.5527, exactly 2√17365.
Is 69460 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 69460?
It is a composite number with 24 divisors.