The number 15133
15133 is a composite number with 4 divisors. Its prime factorisation is 37 × 409. Divisors (4): 1, 37, 409, 15133.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 15133: a semiprime: 37 × 409, the product of two primes.
- 2
15133 is composite. Its prime factorisation is
- 3
The divisors add up to 15580; without 15133 itself that is 447, so 15133 is deficient (447 is less than 15133). Euler's totient φ(15133) = 14688 numbers up to 15133 share no factor with it.
- 4
The digits of 15133 add up to 13, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 133 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15133 = 37 \times 409 \]
15133 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 15580 |
| Euler totient φ(n) | 14688 |
| Square | 229007689 |
| Cube | 3465573357637 |
| Square root | 123.016259 |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 133 |
| Scientific notation | 1.5133 × |
15133 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand one hundred and thirty-three |
| Binary (base 2) | 11101100011101 |
| Octal (base 8) | 35435 |
| Hexadecimal (base 16) | 3B1D |
| Base 3 | 202202111 |
| As time | 15133 seconds = 4 h 12 min 13 s |
Is 15133 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 | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | 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 8) | 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 15133 a prime number?
No. 15133 = 37 × 409, so it is divisible by 37.
What are the factors of 15133?
1, 37, 409, 15133.
What is 15133 in binary?
11101100011101 (hexadecimal 3B1D, octal 35435).
What is the square root of 15133?
About 123.0163.
Is 15133 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 15133?
15133 is a semiprime: 37 × 409, the product of two primes.