The number 14729
14729 is a composite number with 8 divisors. Its prime factorisation is 11 × 13 × 103. Divisors (8): 1, 11, 13, 103, 143, 1133, 1339, 14729.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
14729 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
14729 is composite. Its prime factorisation is
- 3
The divisors add up to 17472; without 14729 itself that is 2743, so 14729 is deficient (2743 is less than 14729). Euler's totient φ(14729) = 12240 numbers up to 14729 share no factor with it.
- 4
The digits of 14729 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 71 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14729 = 11 \times 13 \times 103 \]
14729 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 17472 |
| Euler totient φ(n) | 12240 |
| Square | 216943441 |
| Cube | 3195359942489 |
| Square root | 121.363092 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 71 |
| Scientific notation | 1.4729 × |
14729 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand seven hundred and twenty-nine |
| Binary (base 2) | 11100110001001 |
| Octal (base 8) | 34611 |
| Hexadecimal (base 16) | 3989 |
| Base 3 | 202012112 |
| As time | 14729 seconds = 4 h 5 min 29 s |
Is 14729 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 2) | 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 4) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 5) | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (14729 ÷ 11 = 1339) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 14729 a prime number?
No. 14729 = 11 × 13 × 103, so it is divisible by 11.
What are the factors of 14729?
1, 11, 13, 103, 143, 1133, 1339, 14729.
What is 14729 in binary?
11100110001001 (hexadecimal 3989, octal 34611).
What is the square root of 14729?
About 121.3631.
Is 14729 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 14729?
It is a composite number with 8 divisors.