The number 1479
1479 is a composite number with 8 divisors. Its prime factorisation is 3 × 17 × 29. Divisors (8): 1, 3, 17, 29, 51, 87, 493, 1479.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
1479 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
1479 is composite. Its prime factorisation is
- 3
The divisors add up to 2160; without 1479 itself that is 681, so 1479 is deficient (681 is less than 1479). Euler's totient φ(1479) = 896 numbers up to 1479 share no factor with it.
- 4
The digits of 1479 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 96 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1479 = 3 \times 17 \times 29 \]
1479 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 2160 |
| Euler totient φ(n) | 896 |
| Square | 2187441 |
| Cube | 3235225239 |
| Square root | 38.457769 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 96 |
| Scientific notation | 1.479 × |
1479 in other forms
| Form | Value |
|---|---|
| In words | one thousand four hundred and seventy-nine |
| Roman numerals | MCDLXXIX |
| Binary (base 2) | 10111000111 |
| Octal (base 8) | 2707 |
| Hexadecimal (base 16) | 5C7 |
| Base 3 | 2000210 |
| As time | 1479 seconds = 24 min 39 s |
Is 1479 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 (1479 ÷ 3 = 493) | 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 4) | 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 2) | 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 3) | 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 | No (remainder 5) | 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 1479 a prime number?
No. 1479 = 3 × 17 × 29, so it is divisible by 3.
What are the factors of 1479?
1, 3, 17, 29, 51, 87, 493, 1479.
What is 1479 in binary?
10111000111 (hexadecimal 5C7, octal 2707).
What is the square root of 1479?
About 38.4578.
What is 1479 in Roman numerals?
MCDLXXIX.
Is 1479 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 1479?
It is a composite number with 8 divisors.