The number 46059
46059 is a composite number with 8 divisors. Its prime factorisation is 3 × 13 × 1181. Divisors (8): 1, 3, 13, 39, 1181, 3543, 15353, 46059.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
46059 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
46059 is composite. Its prime factorisation is
- 3
The divisors add up to 66192; without 46059 itself that is 20133, so 46059 is deficient (20133 is less than 46059). Euler's totient φ(46059) = 28320 numbers up to 46059 share no factor with it.
- 4
The digits of 46059 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 132 steps to reach 1.
LaTeX source of the formulas on this page
\[ 46059 = 3 \times 13 \times 1181 \]
46059 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 66192 |
| Euler totient φ(n) | 28320 |
| Square | 2121431481 |
| Cube | 97711012583379 |
| Square root | 214.613606 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 132 |
| Scientific notation | 4.6059 × |
46059 in other forms
| Form | Value |
|---|---|
| In words | forty-six thousand and fifty-nine |
| Binary (base 2) | 1011001111101011 |
| Octal (base 8) | 131753 |
| Hexadecimal (base 16) | B3EB |
| Base 3 | 2100011220 |
| As time | 46059 seconds = 12 h 47 min 39 s |
Is 46059 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 (46059 ÷ 3 = 15353) | 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 4) | 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 3) | 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 9) | 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 46059 a prime number?
No. 46059 = 3 × 13 × 1181, so it is divisible by 3.
What are the factors of 46059?
1, 3, 13, 39, 1181, 3543, 15353, 46059.
What is 46059 in binary?
1011001111101011 (hexadecimal B3EB, octal 131753).
What is the square root of 46059?
About 214.6136.
Is 46059 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 46059?
It is a composite number with 8 divisors.