The number 14948
14948 is a composite number with 12 divisors. Its prime factorisation is × 37 × 101. Divisors (12): 1, 2, 4, 37, 74, 101, 148, 202, 404, 3737, 7474, 14948.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
14948 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
14948 is composite. Its prime factorisation is
- 3
The divisors add up to 27132; without 14948 itself that is 12184, so 14948 is deficient (12184 is less than 14948). Euler's totient φ(14948) = 7200 numbers up to 14948 share no factor with it.
- 4
The digits of 14948 add up to 26, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 102 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14948 = 2^{2} \times 37 \times 101 \]14948 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 27132 |
| Euler totient φ(n) | 7200 |
| Square | 223442704 |
| Cube | 3340021539392 |
| Square root | 122.262014 (= 2√3737) |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 102 |
| Scientific notation | 1.4948 × |
14948 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand nine hundred and forty-eight |
| Binary (base 2) | 11101001100100 |
| Octal (base 8) | 35144 |
| Hexadecimal (base 16) | 3A64 |
| Base 3 | 202111122 |
| As time | 14948 seconds = 4 h 9 min 8 s |
Is 14948 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (14948 ÷ 2 = 7474) | 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 | Yes (14948 ÷ 4 = 3737) | 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 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 8) | 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 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 14948 a prime number?
No. 14948 = × 37 × 101, so it is divisible by 2.
What are the factors of 14948?
1, 2, 4, 37, 74, 101, 148, 202, 404, 3737, 7474, 14948.
What is 14948 in binary?
11101001100100 (hexadecimal 3A64, octal 35144).
What is the square root of 14948?
About 122.2620, exactly 2√3737.
Is 14948 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 14948?
It is a composite number with 12 divisors.