The number 46470
46470 is a composite number with 16 divisors. Its prime factorisation is 2 × 3 × 5 × 1549. Divisors (16): 1, 2, 3, 5, 6, 10, 15, 30, 1549, 3098, 4647, 7745, 9294, 15490, 23235, 46470.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
46470 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
46470 is composite. Its prime factorisation is
- 3
The divisors add up to 111600; without 46470 itself that is 65130, so 46470 is abundant (65130 is more than 46470). Euler's totient φ(46470) = 12384 numbers up to 46470 share no factor with it.
- 4
The digits of 46470 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 145 steps to reach 1.
LaTeX source of the formulas on this page
\[ 46470 = 2 \times 3 \times 5 \times 1549 \]
46470 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 111600 |
| Euler totient φ(n) | 12384 |
| Square | 2159460900 |
| Cube | 100350148023000 |
| Square root | 215.569014 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 145 |
| Scientific notation | 4.647 × |
46470 in other forms
| Form | Value |
|---|---|
| In words | forty-six thousand four hundred and seventy |
| Binary (base 2) | 1011010110000110 |
| Octal (base 8) | 132606 |
| Hexadecimal (base 16) | B586 |
| Base 3 | 2100202010 |
| As time | 46470 seconds = 12 h 54 min 30 s |
Is 46470 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (46470 ÷ 2 = 23235) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (46470 ÷ 3 = 15490) | 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 | Yes (46470 ÷ 5 = 9294) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (46470 ÷ 6 = 7745) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (46470 ÷ 10 = 4647) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 46470 a prime number?
No. 46470 = 2 × 3 × 5 × 1549, so it is divisible by 2.
What are the factors of 46470?
1, 2, 3, 5, 6, 10, 15, 30, 1549, 3098, 4647, 7745, 9294, 15490, 23235, 46470.
What is 46470 in binary?
1011010110000110 (hexadecimal B586, octal 132606).
What is the square root of 46470?
About 215.5690.
Is 46470 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 46470?
It is a composite number with 16 divisors.