The number 14746
14746 is a composite number with 8 divisors. Its prime factorisation is 2 × 73 × 101. Divisors (8): 1, 2, 73, 101, 146, 202, 7373, 14746.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
14746 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
14746 is composite. Its prime factorisation is
- 3
The divisors add up to 22644; without 14746 itself that is 7898, so 14746 is deficient (7898 is less than 14746). Euler's totient φ(14746) = 7200 numbers up to 14746 share no factor with it.
- 4
The digits of 14746 add up to 22, 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
\[ 14746 = 2 \times 73 \times 101 \]
14746 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 22644 |
| Euler totient φ(n) | 7200 |
| Square | 217444516 |
| Cube | 3206436832936 |
| Square root | 121.433109 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 133 |
| Scientific notation | 1.4746 × |
14746 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand seven hundred and forty-six |
| Binary (base 2) | 11100110011010 |
| Octal (base 8) | 34632 |
| Hexadecimal (base 16) | 399A |
| Base 3 | 202020011 |
| As time | 14746 seconds = 4 h 5 min 46 s |
Is 14746 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (14746 ÷ 2 = 7373) | 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 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | 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 2) | 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 6) | 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 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 14746 a prime number?
No. 14746 = 2 × 73 × 101, so it is divisible by 2.
What are the factors of 14746?
1, 2, 73, 101, 146, 202, 7373, 14746.
What is 14746 in binary?
11100110011010 (hexadecimal 399A, octal 34632).
What is the square root of 14746?
About 121.4331.
Is 14746 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 14746?
It is a composite number with 8 divisors.