The number 447
447 is a composite number with 4 divisors. Its prime factorisation is 3 × 149. Divisors (4): 1, 3, 149, 447.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 447: a semiprime: 3 × 149, the product of two primes.
- 2
447 is composite. Its prime factorisation is
- 3
The divisors add up to 600; without 447 itself that is 153, so 447 is deficient (153 is less than 447). Euler's totient φ(447) = 296 numbers up to 447 share no factor with it.
- 4
The digits of 447 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 97 steps to reach 1.
LaTeX source of the formulas on this page
\[ 447 = 3 \times 149 \]
447 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 600 |
| Euler totient φ(n) | 296 |
| Square | 199809 |
| Cube | 89314623 |
| Square root | 21.142375 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 97 |
| Scientific notation | 4.47 × |
447 in other forms
| Form | Value |
|---|---|
| In words | four hundred and forty-seven |
| Roman numerals | CDXLVII |
| Binary (base 2) | 110111111 |
| Octal (base 8) | 677 |
| Hexadecimal (base 16) | 1BF |
| Base 3 | 121120 |
| As time | 447 seconds = 7 min 27 s |
Is 447 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 (447 ÷ 3 = 149) | 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 2) | 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 6) | 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 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 7) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | 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 447 a prime number?
No. 447 = 3 × 149, so it is divisible by 3.
What are the factors of 447?
1, 3, 149, 447.
What is 447 in binary?
110111111 (hexadecimal 1BF, octal 677).
What is the square root of 447?
About 21.1424.
What is 447 in Roman numerals?
CDXLVII.
Is 447 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 447?
447 is a semiprime: 3 × 149, the product of two primes.