The number 46983
46983 is a composite number with 4 divisors. Its prime factorisation is 3 × 15661. Divisors (4): 1, 3, 15661, 46983.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 46983: a semiprime: 3 × 15661, the product of two primes.
- 2
46983 is composite. Its prime factorisation is
- 3
The divisors add up to 62648; without 46983 itself that is 15665, so 46983 is deficient (15665 is less than 46983). Euler's totient φ(46983) = 31320 numbers up to 46983 share no factor with it.
- 4
The digits of 46983 add up to 30, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 83 steps to reach 1.
LaTeX source of the formulas on this page
\[ 46983 = 3 \times 15661 \]
46983 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 62648 |
| Euler totient φ(n) | 31320 |
| Square | 2207402289 |
| Cube | 103710381744087 |
| Square root | 216.755623 |
| Digit sum / digital root | 30 / 3 |
| Collatz steps to 1 | 83 |
| Scientific notation | 4.6983 × |
46983 in other forms
| Form | Value |
|---|---|
| In words | forty-six thousand nine hundred and eighty-three |
| Binary (base 2) | 1011011110000111 |
| Octal (base 8) | 133607 |
| Hexadecimal (base 16) | B787 |
| Base 3 | 2101110010 |
| As time | 46983 seconds = 13 h 3 min 3 s |
Is 46983 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 (46983 ÷ 3 = 15661) | 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 3) | 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 7) | 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 | No (remainder 3) | 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 46983 a prime number?
No. 46983 = 3 × 15661, so it is divisible by 3.
What are the factors of 46983?
1, 3, 15661, 46983.
What is 46983 in binary?
1011011110000111 (hexadecimal B787, octal 133607).
What is the square root of 46983?
About 216.7556.
Is 46983 divisible by 3?
Yes. Its digits add up to 30, a multiple of 3.
What is special about the number 46983?
46983 is a semiprime: 3 × 15661, the product of two primes.