The number 14933
14933 is a composite number with 4 divisors. Its prime factorisation is 109 × 137. Divisors (4): 1, 109, 137, 14933.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 14933: a semiprime: 109 × 137, the product of two primes.
- 2
14933 is composite. Its prime factorisation is
- 3
The divisors add up to 15180; without 14933 itself that is 247, so 14933 is deficient (247 is less than 14933). Euler's totient φ(14933) = 14688 numbers up to 14933 share no factor with it.
- 4
The digits of 14933 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 89 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14933 = 109 \times 137 \]
14933 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 15180 |
| Euler totient φ(n) | 14688 |
| Square | 222994489 |
| Cube | 3329976704237 |
| Square root | 122.200655 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 89 |
| Scientific notation | 1.4933 × |
14933 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand nine hundred and thirty-three |
| Binary (base 2) | 11101001010101 |
| Octal (base 8) | 35125 |
| Hexadecimal (base 16) | 3A55 |
| Base 3 | 202111002 |
| As time | 14933 seconds = 4 h 8 min 53 s |
Is 14933 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 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 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 2) | 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 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 14933 a prime number?
No. 14933 = 109 × 137, so it is divisible by 109.
What are the factors of 14933?
1, 109, 137, 14933.
What is 14933 in binary?
11101001010101 (hexadecimal 3A55, octal 35125).
What is the square root of 14933?
About 122.2007.
Is 14933 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 14933?
14933 is a semiprime: 109 × 137, the product of two primes.