The number 14761
14761 is a composite number with 4 divisors. Its prime factorisation is 29 × 509. Divisors (4): 1, 29, 509, 14761.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 14761: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 29 × 509, the product of two primes.
- 2
14761 is composite. Its prime factorisation is
- 3
The divisors add up to 15300; without 14761 itself that is 539, so 14761 is deficient (539 is less than 14761). Euler's totient φ(14761) = 14224 numbers up to 14761 share no factor with it.
- 4
The digits of 14761 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 133 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14761 = 29 \times 509 \]
14761 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 15300 |
| Euler totient φ(n) | 14224 |
| Square | 217887121 |
| Cube | 3216231793081 |
| Square root | 121.494856 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 133 |
| Scientific notation | 1.4761 × |
14761 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand seven hundred and sixty-one |
| Binary (base 2) | 11100110101001 |
| Octal (base 8) | 34651 |
| Hexadecimal (base 16) | 39A9 |
| Base 3 | 202020201 |
| As time | 14761 seconds = 4 h 6 min 1 s |
Is 14761 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 1) | 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 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 1) | 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 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 14761 a prime number?
No. 14761 = 29 × 509, so it is divisible by 29.
What are the factors of 14761?
1, 29, 509, 14761.
What is 14761 in binary?
11100110101001 (hexadecimal 39A9, octal 34651).
What is the square root of 14761?
About 121.4949.
Is 14761 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 14761?
14761 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 29 × 509, the product of two primes.