The number 46455
46455 is a composite number with 16 divisors. Its prime factorisation is 3 × 5 × 19 × 163. Divisors (16): 1, 3, 5, 15, 19, 57, 95, 163, 285, 489, 815, 2445, 3097, 9291, 15485, 46455.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
46455 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
46455 is composite. Its prime factorisation is
- 3
The divisors add up to 78720; without 46455 itself that is 32265, so 46455 is deficient (32265 is less than 46455). Euler's totient φ(46455) = 23328 numbers up to 46455 share no factor with it.
- 4
The digits of 46455 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 57 steps to reach 1.
LaTeX source of the formulas on this page
\[ 46455 = 3 \times 5 \times 19 \times 163 \]
46455 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 78720 |
| Euler totient φ(n) | 23328 |
| Square | 2158067025 |
| Cube | 100253003646375 |
| Square root | 215.534220 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 57 |
| Scientific notation | 4.6455 × |
46455 in other forms
| Form | Value |
|---|---|
| In words | forty-six thousand four hundred and fifty-five |
| Binary (base 2) | 1011010101110111 |
| Octal (base 8) | 132567 |
| Hexadecimal (base 16) | B577 |
| Base 3 | 2100201120 |
| As time | 46455 seconds = 12 h 54 min 15 s |
Is 46455 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 (46455 ÷ 3 = 15485) | 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 | Yes (46455 ÷ 5 = 9291) | 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 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 5) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | 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 46455 a prime number?
No. 46455 = 3 × 5 × 19 × 163, so it is divisible by 3.
What are the factors of 46455?
1, 3, 5, 15, 19, 57, 95, 163, 285, 489, 815, 2445, 3097, 9291, 15485, 46455.
What is 46455 in binary?
1011010101110111 (hexadecimal B577, octal 132567).
What is the square root of 46455?
About 215.5342.
Is 46455 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 46455?
It is a composite number with 16 divisors.