The number 1478
1478 is a composite number with 4 divisors. Its prime factorisation is 2 × 739. Divisors (4): 1, 2, 739, 1478.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 1478: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 2 × 739, the product of two primes.
- 2
1478 is composite. Its prime factorisation is
- 3
The divisors add up to 2220; without 1478 itself that is 742, so 1478 is deficient (742 is less than 1478). Euler's totient φ(1478) = 738 numbers up to 1478 share no factor with it.
- 4
The digits of 1478 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 21 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1478 = 2 \times 739 \]
1478 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 2220 |
| Euler totient φ(n) | 738 |
| Square | 2184484 |
| Cube | 3228667352 |
| Square root | 38.444766 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 21 |
| Scientific notation | 1.478 × |
1478 in other forms
| Form | Value |
|---|---|
| In words | one thousand four hundred and seventy-eight |
| Roman numerals | MCDLXXVIII |
| Binary (base 2) | 10111000110 |
| Octal (base 8) | 2706 |
| Hexadecimal (base 16) | 5C6 |
| Base 3 | 2000202 |
| As time | 1478 seconds = 24 min 38 s |
Is 1478 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (1478 ÷ 2 = 739) | 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 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 8) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 1478 a prime number?
No. 1478 = 2 × 739, so it is divisible by 2.
What are the factors of 1478?
1, 2, 739, 1478.
What is 1478 in binary?
10111000110 (hexadecimal 5C6, octal 2706).
What is the square root of 1478?
About 38.4448.
What is 1478 in Roman numerals?
MCDLXXVIII.
Is 1478 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 1478?
1478 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 2 × 739, the product of two primes.