The number 1473
1473 is a composite number with 4 divisors. Its prime factorisation is 3 × 491. Divisors (4): 1, 3, 491, 1473.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 1473: a semiprime: 3 × 491, the product of two primes.
- 2
1473 is composite. Its prime factorisation is
- 3
The divisors add up to 1968; without 1473 itself that is 495, so 1473 is deficient (495 is less than 1473). Euler's totient φ(1473) = 980 numbers up to 1473 share no factor with it.
- 4
The digits of 1473 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 96 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1473 = 3 \times 491 \]
1473 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 1968 |
| Euler totient φ(n) | 980 |
| Square | 2169729 |
| Cube | 3196010817 |
| Square root | 38.379682 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 96 |
| Scientific notation | 1.473 × |
1473 in other forms
| Form | Value |
|---|---|
| In words | one thousand four hundred and seventy-three |
| Roman numerals | MCDLXXIII |
| Binary (base 2) | 10111000001 |
| Octal (base 8) | 2701 |
| Hexadecimal (base 16) | 5C1 |
| Base 3 | 2000120 |
| As time | 1473 seconds = 24 min 33 s |
Is 1473 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 (1473 ÷ 3 = 491) | 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 3) | 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 3) | 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 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 3) | 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 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 1473 a prime number?
No. 1473 = 3 × 491, so it is divisible by 3.
What are the factors of 1473?
1, 3, 491, 1473.
What is 1473 in binary?
10111000001 (hexadecimal 5C1, octal 2701).
What is the square root of 1473?
About 38.3797.
What is 1473 in Roman numerals?
MCDLXXIII.
Is 1473 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 1473?
1473 is a semiprime: 3 × 491, the product of two primes.