The number 14631
14631 is a binary palindrome (11100100100111). Its prime factorisation is 3 × 4877. Divisors (4): 1, 3, 4877, 14631.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 14631: a binary palindrome (11100100100111); a semiprime: 3 × 4877, the product of two primes.
- 2
14631 is composite. Its prime factorisation is
- 3
The divisors add up to 19512; without 14631 itself that is 4881, so 14631 is deficient (4881 is less than 14631). Euler's totient φ(14631) = 9752 numbers up to 14631 share no factor with it.
- 4
The digits of 14631 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 58 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14631 = 3 \times 4877 \]
14631 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 19512 |
| Euler totient φ(n) | 9752 |
| Square | 214066161 |
| Cube | 3132002001591 |
| Square root | 120.958671 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 58 |
| Scientific notation | 1.4631 × |
14631 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand six hundred and thirty-one |
| Binary (base 2) | 11100100100111 |
| Octal (base 8) | 34447 |
| Hexadecimal (base 16) | 3927 |
| Base 3 | 202001220 |
| As time | 14631 seconds = 4 h 3 min 51 s |
Is 14631 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 (14631 ÷ 3 = 4877) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | 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 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 7) | 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 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 14631 a prime number?
No. 14631 = 3 × 4877, so it is divisible by 3.
What are the factors of 14631?
1, 3, 4877, 14631.
What is 14631 in binary?
11100100100111 (hexadecimal 3927, octal 34447).
What is the square root of 14631?
About 120.9587.
Is 14631 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 14631?
14631 is a binary palindrome (11100100100111); a semiprime: 3 × 4877, the product of two primes.