The number 11259
11259 is a composite number with 10 divisors. Its prime factorisation is × 139. Divisors (10): 1, 3, 9, 27, 81, 139, 417, 1251, 3753, 11259.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
11259 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
11259 is composite. Its prime factorisation is
- 3
The divisors add up to 16940; without 11259 itself that is 5681, so 11259 is deficient (5681 is less than 11259). Euler's totient φ(11259) = 7452 numbers up to 11259 share no factor with it.
- 4
The digits of 11259 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 60 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11259 = 3^{4} \times 139 \]11259 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 10 |
| Sum of divisors | 16940 |
| Euler totient φ(n) | 7452 |
| Square | 126765081 |
| Cube | 1427248046979 |
| Square root | 106.108435 (= 9√139) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 60 |
| Scientific notation | 1.1259 × |
11259 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand two hundred and fifty-nine |
| Binary (base 2) | 10101111111011 |
| Octal (base 8) | 25773 |
| Hexadecimal (base 16) | 2BFB |
| Base 3 | 120110000 |
| As time | 11259 seconds = 3 h 7 min 39 s |
Is 11259 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 (11259 ÷ 3 = 3753) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 4) | 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 3) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (11259 ÷ 9 = 1251) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 9) | 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 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 11259 a prime number?
No. 11259 = × 139, so it is divisible by 3.
What are the factors of 11259?
1, 3, 9, 27, 81, 139, 417, 1251, 3753, 11259.
What is 11259 in binary?
10101111111011 (hexadecimal 2BFB, octal 25773).
What is the square root of 11259?
About 106.1084, exactly 9√139.
Is 11259 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 11259?
It is a composite number with 10 divisors.