The number 11433
11433 is a composite number with 8 divisors. Its prime factorisation is 3 × 37 × 103. Divisors (8): 1, 3, 37, 103, 111, 309, 3811, 11433.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
11433 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
11433 is composite. Its prime factorisation is
- 3
The divisors add up to 15808; without 11433 itself that is 4375, so 11433 is deficient (4375 is less than 11433). Euler's totient φ(11433) = 7344 numbers up to 11433 share no factor with it.
- 4
The digits of 11433 add up to 12, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 130 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11433 = 3 \times 37 \times 103 \]
11433 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 15808 |
| Euler totient φ(n) | 7344 |
| Square | 130713489 |
| Cube | 1494447319737 |
| Square root | 106.925208 |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 130 |
| Scientific notation | 1.1433 × |
11433 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand four hundred and thirty-three |
| Binary (base 2) | 10110010101001 |
| Octal (base 8) | 26251 |
| Hexadecimal (base 16) | 2CA9 |
| Base 3 | 120200110 |
| As time | 11433 seconds = 3 h 10 min 33 s |
Is 11433 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 | Yes (11433 ÷ 3 = 3811) | 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 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 3) | 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 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 11433 a prime number?
No. 11433 = 3 × 37 × 103, so it is divisible by 3.
What are the factors of 11433?
1, 3, 37, 103, 111, 309, 3811, 11433.
What is 11433 in binary?
10110010101001 (hexadecimal 2CA9, octal 26251).
What is the square root of 11433?
About 106.9252.
Is 11433 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 11433?
It is a composite number with 8 divisors.