The number 46923
46923 is a composite number with 4 divisors. Its prime factorisation is 3 × 15641. Divisors (4): 1, 3, 15641, 46923.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 46923: a semiprime: 3 × 15641, the product of two primes.
- 2
46923 is composite. Its prime factorisation is
- 3
The divisors add up to 62568; without 46923 itself that is 15645, so 46923 is deficient (15645 is less than 46923). Euler's totient φ(46923) = 31280 numbers up to 46923 share no factor with it.
- 4
The digits of 46923 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 39 steps to reach 1.
LaTeX source of the formulas on this page
\[ 46923 = 3 \times 15641 \]
46923 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 62568 |
| Euler totient φ(n) | 31280 |
| Square | 2201767929 |
| Cube | 103313556532467 |
| Square root | 216.617174 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 39 |
| Scientific notation | 4.6923 × |
46923 in other forms
| Form | Value |
|---|---|
| In words | forty-six thousand nine hundred and twenty-three |
| Binary (base 2) | 1011011101001011 |
| Octal (base 8) | 133513 |
| Hexadecimal (base 16) | B74B |
| Base 3 | 2101100220 |
| As time | 46923 seconds = 13 h 2 min 3 s |
Is 46923 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 (46923 ÷ 3 = 15641) | 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 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 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 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | 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 46923 a prime number?
No. 46923 = 3 × 15641, so it is divisible by 3.
What are the factors of 46923?
1, 3, 15641, 46923.
What is 46923 in binary?
1011011101001011 (hexadecimal B74B, octal 133513).
What is the square root of 46923?
About 216.6172.
Is 46923 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 46923?
46923 is a semiprime: 3 × 15641, the product of two primes.