The number 15483
15483 is a composite number with 8 divisors. Its prime factorisation is 3 × 13 × 397. Divisors (8): 1, 3, 13, 39, 397, 1191, 5161, 15483.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
15483 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
15483 is composite. Its prime factorisation is
- 3
The divisors add up to 22288; without 15483 itself that is 6805, so 15483 is deficient (6805 is less than 15483). Euler's totient φ(15483) = 9504 numbers up to 15483 share no factor with it.
- 4
The digits of 15483 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 146 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15483 = 3 \times 13 \times 397 \]
15483 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 22288 |
| Euler totient φ(n) | 9504 |
| Square | 239723289 |
| Cube | 3711635683587 |
| Square root | 124.430704 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 146 |
| Scientific notation | 1.5483 × |
15483 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand four hundred and eighty-three |
| Binary (base 2) | 11110001111011 |
| Octal (base 8) | 36173 |
| Hexadecimal (base 16) | 3C7B |
| Base 3 | 210020110 |
| As time | 15483 seconds = 4 h 18 min 3 s |
Is 15483 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 (15483 ÷ 3 = 5161) | 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 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 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 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 15483 a prime number?
No. 15483 = 3 × 13 × 397, so it is divisible by 3.
What are the factors of 15483?
1, 3, 13, 39, 397, 1191, 5161, 15483.
What is 15483 in binary?
11110001111011 (hexadecimal 3C7B, octal 36173).
What is the square root of 15483?
About 124.4307.
Is 15483 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 15483?
It is a composite number with 8 divisors.