The number 46159
46159 is a composite number with 4 divisors. Its prime factorisation is 31 × 1489. Divisors (4): 1, 31, 1489, 46159.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 46159: a semiprime: 31 × 1489, the product of two primes.
- 2
46159 is composite. Its prime factorisation is
- 3
The divisors add up to 47680; without 46159 itself that is 1521, so 46159 is deficient (1521 is less than 46159). Euler's totient φ(46159) = 44640 numbers up to 46159 share no factor with it.
- 4
The digits of 46159 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 57 steps to reach 1.
LaTeX source of the formulas on this page
\[ 46159 = 31 \times 1489 \]
46159 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 47680 |
| Euler totient φ(n) | 44640 |
| Square | 2130653281 |
| Cube | 98348824797679 |
| Square root | 214.846457 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 57 |
| Scientific notation | 4.6159 × |
46159 in other forms
| Form | Value |
|---|---|
| In words | forty-six thousand one hundred and fifty-nine |
| Binary (base 2) | 1011010001001111 |
| Octal (base 8) | 132117 |
| Hexadecimal (base 16) | B44F |
| Base 3 | 2100022121 |
| As time | 46159 seconds = 12 h 49 min 19 s |
Is 46159 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 1) | 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 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 7) | 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 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 46159 a prime number?
No. 46159 = 31 × 1489, so it is divisible by 31.
What are the factors of 46159?
1, 31, 1489, 46159.
What is 46159 in binary?
1011010001001111 (hexadecimal B44F, octal 132117).
What is the square root of 46159?
About 214.8465.
Is 46159 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 46159?
46159 is a semiprime: 31 × 1489, the product of two primes.