The number 14937
14937 is a composite number with 8 divisors. Its prime factorisation is 3 × 13 × 383. Divisors (8): 1, 3, 13, 39, 383, 1149, 4979, 14937.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
14937 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
14937 is composite. Its prime factorisation is
- 3
The divisors add up to 21504; without 14937 itself that is 6567, so 14937 is deficient (6567 is less than 14937). Euler's totient φ(14937) = 9168 numbers up to 14937 share no factor with it.
- 4
The digits of 14937 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 71 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14937 = 3 \times 13 \times 383 \]
14937 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 21504 |
| Euler totient φ(n) | 9168 |
| Square | 223113969 |
| Cube | 3332653354953 |
| Square root | 122.217020 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 71 |
| Scientific notation | 1.4937 × |
14937 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand nine hundred and thirty-seven |
| Binary (base 2) | 11101001011001 |
| Octal (base 8) | 35131 |
| Hexadecimal (base 16) | 3A59 |
| Base 3 | 202111020 |
| As time | 14937 seconds = 4 h 8 min 57 s |
Is 14937 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 (14937 ÷ 3 = 4979) | 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 2) | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 7) | 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 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 14937 a prime number?
No. 14937 = 3 × 13 × 383, so it is divisible by 3.
What are the factors of 14937?
1, 3, 13, 39, 383, 1149, 4979, 14937.
What is 14937 in binary?
11101001011001 (hexadecimal 3A59, octal 35131).
What is the square root of 14937?
About 122.2170.
Is 14937 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 14937?
It is a composite number with 8 divisors.