The number 46055
46055 is a composite number with 8 divisors. Its prime factorisation is 5 × 61 × 151. Divisors (8): 1, 5, 61, 151, 305, 755, 9211, 46055.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
46055 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
46055 is composite. Its prime factorisation is
- 3
The divisors add up to 56544; without 46055 itself that is 10489, so 46055 is deficient (10489 is less than 46055). Euler's totient φ(46055) = 36000 numbers up to 46055 share no factor with it.
- 4
The digits of 46055 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 176 steps to reach 1.
LaTeX source of the formulas on this page
\[ 46055 = 5 \times 61 \times 151 \]
46055 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 56544 |
| Euler totient φ(n) | 36000 |
| Square | 2121063025 |
| Cube | 97685557616375 |
| Square root | 214.604287 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 176 |
| Scientific notation | 4.6055 × |
46055 in other forms
| Form | Value |
|---|---|
| In words | forty-six thousand and fifty-five |
| Binary (base 2) | 1011001111100111 |
| Octal (base 8) | 131747 |
| Hexadecimal (base 16) | B3E7 |
| Base 3 | 2100011202 |
| As time | 46055 seconds = 12 h 47 min 35 s |
Is 46055 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 | No (remainder 2) | 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 (46055 ÷ 5 = 9211) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 2) | 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 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 46055 a prime number?
No. 46055 = 5 × 61 × 151, so it is divisible by 5.
What are the factors of 46055?
1, 5, 61, 151, 305, 755, 9211, 46055.
What is 46055 in binary?
1011001111100111 (hexadecimal B3E7, octal 131747).
What is the square root of 46055?
About 214.6043.
Is 46055 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 46055?
It is a composite number with 8 divisors.