The number 69433
69433 is a composite number with 12 divisors. Its prime factorisation is × 13 × 109. Divisors (12): 1, 7, 13, 49, 91, 109, 637, 763, 1417, 5341, 9919, 69433.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
69433 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
69433 is composite. Its prime factorisation is
- 3
The divisors add up to 87780; without 69433 itself that is 18347, so 69433 is deficient (18347 is less than 69433). Euler's totient φ(69433) = 54432 numbers up to 69433 share no factor with it.
- 4
The digits of 69433 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 55 steps to reach 1.
LaTeX source of the formulas on this page
\[ 69433 = 7^{2} \times 13 \times 109 \]69433 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 87780 |
| Euler totient φ(n) | 54432 |
| Square | 4820941489 |
| Cube | 334732430405737 |
| Square root | 263.501423 (= 7√1417) |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 55 |
| Scientific notation | 6.9433 × |
69433 in other forms
| Form | Value |
|---|---|
| In words | sixty-nine thousand four hundred and thirty-three |
| Binary (base 2) | 10000111100111001 |
| Octal (base 8) | 207471 |
| Hexadecimal (base 16) | 10F39 |
| Base 3 | 10112020121 |
| As time | 69433 seconds = 19 h 17 min 13 s |
Is 69433 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 1) | 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 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (69433 ÷ 7 = 9919) | 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 1) | 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 | No (remainder 3) | 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 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 69433 a prime number?
No. 69433 = × 13 × 109, so it is divisible by 7.
What are the factors of 69433?
1, 7, 13, 49, 91, 109, 637, 763, 1417, 5341, 9919, 69433.
What is 69433 in binary?
10000111100111001 (hexadecimal 10F39, octal 207471).
What is the square root of 69433?
About 263.5014, exactly 7√1417.
Is 69433 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 69433?
It is a composite number with 12 divisors.