The number 46531
46531 is a composite number with 8 divisors. Its prime factorisation is 19 × 31 × 79. Divisors (8): 1, 19, 31, 79, 589, 1501, 2449, 46531.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 46531: a Harshad number: divisible by its digit sum 19.
- 2
46531 is composite. Its prime factorisation is
- 3
The divisors add up to 51200; without 46531 itself that is 4669, so 46531 is deficient (4669 is less than 46531). Euler's totient φ(46531) = 42120 numbers up to 46531 share no factor with it.
- 4
The digits of 46531 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 114 steps to reach 1.
LaTeX source of the formulas on this page
\[ 46531 = 19 \times 31 \times 79 \]
46531 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 51200 |
| Euler totient φ(n) | 42120 |
| Square | 2165133961 |
| Cube | 100745848339291 |
| Square root | 215.710454 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 114 |
| Scientific notation | 4.6531 × |
46531 in other forms
| Form | Value |
|---|---|
| In words | forty-six thousand five hundred and thirty-one |
| Binary (base 2) | 1011010111000011 |
| Octal (base 8) | 132703 |
| Hexadecimal (base 16) | B5C3 |
| Base 3 | 2100211101 |
| As time | 46531 seconds = 12 h 55 min 31 s |
Is 46531 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 1) | 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 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 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | 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 46531 a prime number?
No. 46531 = 19 × 31 × 79, so it is divisible by 19.
What are the factors of 46531?
1, 19, 31, 79, 589, 1501, 2449, 46531.
What is 46531 in binary?
1011010111000011 (hexadecimal B5C3, octal 132703).
What is the square root of 46531?
About 215.7105.
Is 46531 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 46531?
46531 is a Harshad number: divisible by its digit sum 19.