The number 69402
69402 is a composite number with 16 divisors. Its prime factorisation is 2 × 3 × 43 × 269. Divisors (16): 1, 2, 3, 6, 43, 86, 129, 258, 269, 538, 807, 1614, 11567, 23134, 34701, 69402.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
69402 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
69402 is composite. Its prime factorisation is
- 3
The divisors add up to 142560; without 69402 itself that is 73158, so 69402 is abundant (73158 is more than 69402). Euler's totient φ(69402) = 22512 numbers up to 69402 share no factor with it.
- 4
The digits of 69402 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 50 steps to reach 1.
LaTeX source of the formulas on this page
\[ 69402 = 2 \times 3 \times 43 \times 269 \]
69402 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 142560 |
| Euler totient φ(n) | 22512 |
| Square | 4816637604 |
| Cube | 334284282992808 |
| Square root | 263.442593 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 50 |
| Scientific notation | 6.9402 × |
69402 in other forms
| Form | Value |
|---|---|
| In words | sixty-nine thousand four hundred and two |
| Binary (base 2) | 10000111100011010 |
| Octal (base 8) | 207432 |
| Hexadecimal (base 16) | 10F1A |
| Base 3 | 10112012110 |
| As time | 69402 seconds = 19 h 16 min 42 s |
Is 69402 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (69402 ÷ 2 = 34701) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (69402 ÷ 3 = 23134) | 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 | No (remainder 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (69402 ÷ 6 = 11567) | 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 2) | 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 | No (remainder 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 3) | 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 69402 a prime number?
No. 69402 = 2 × 3 × 43 × 269, so it is divisible by 2.
What are the factors of 69402?
1, 2, 3, 6, 43, 86, 129, 258, 269, 538, 807, 1614, 11567, 23134, 34701, 69402.
What is 69402 in binary?
10000111100011010 (hexadecimal 10F1A, octal 207432).
What is the square root of 69402?
About 263.4426.
Is 69402 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 69402?
It is a composite number with 16 divisors.