The number 15033
15033 is a composite number with 4 divisors. Its prime factorisation is 3 × 5011. Divisors (4): 1, 3, 5011, 15033.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 15033: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 3 × 5011, the product of two primes.
- 2
15033 is composite. Its prime factorisation is
- 3
The divisors add up to 20048; without 15033 itself that is 5015, so 15033 is deficient (5015 is less than 15033). Euler's totient φ(15033) = 10020 numbers up to 15033 share no factor with it.
- 4
The digits of 15033 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 89 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15033 = 3 \times 5011 \]
15033 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 20048 |
| Euler totient φ(n) | 10020 |
| Square | 225991089 |
| Cube | 3397324040937 |
| Square root | 122.609135 |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 89 |
| Scientific notation | 1.5033 × |
15033 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand and thirty-three |
| Binary (base 2) | 11101010111001 |
| Octal (base 8) | 35271 |
| Hexadecimal (base 16) | 3AB9 |
| Base 3 | 202121210 |
| As time | 15033 seconds = 4 h 10 min 33 s |
Is 15033 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 (15033 ÷ 3 = 5011) | 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 4) | 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 7) | 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 15033 a prime number?
No. 15033 = 3 × 5011, so it is divisible by 3.
What are the factors of 15033?
1, 3, 5011, 15033.
What is 15033 in binary?
11101010111001 (hexadecimal 3AB9, octal 35271).
What is the square root of 15033?
About 122.6091.
Is 15033 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 15033?
15033 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 3 × 5011, the product of two primes.