The number 11483
11483 is the 1384th prime number. Its only divisors are 1 and 11483.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 11483: the 1384th prime number; a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
11483 is prime, so its only factors are 1 and 11483. It is the 1384th prime; the next prime is 11489 and the one before is 11471.
- 3
The divisors add up to 11484; without 11483 itself that is 1, so 11483 is deficient (1 is less than 11483). Euler's totient φ(11483) = 11482 numbers up to 11483 share no factor with it.
- 4
The digits of 11483 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 81 steps to reach 1.
11483 at a glance
| Property | Value |
|---|---|
| Type | prime |
| Number of divisors | 2 |
| Sum of divisors | 11484 |
| Euler totient φ(n) | 11482 |
| Square | 131859289 |
| Cube | 1514140215587 |
| Square root | 107.158761 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 81 |
| Scientific notation | 1.1483 × |
11483 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand four hundred and eighty-three |
| Binary (base 2) | 10110011011011 |
| Octal (base 8) | 26333 |
| Hexadecimal (base 16) | 2CDB |
| Base 3 | 120202022 |
| As time | 11483 seconds = 3 h 11 min 23 s |
Is 11483 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 2) | 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 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 5) | 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 | No (remainder 8) | 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 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 11483 a prime number?
Yes. 11483 is divisible only by 1 and itself.
What are the factors of 11483?
1, 11483.
What is 11483 in binary?
10110011011011 (hexadecimal 2CDB, octal 26333).
What is the square root of 11483?
About 107.1588.
Is 11483 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 11483?
11483 is the 1384th prime number; a happy number: repeatedly adding the squares of its digits reaches 1.