The number 46533
46533 is a composite number with 4 divisors. Its prime factorisation is 3 × 15511. Divisors (4): 1, 3, 15511, 46533.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 46533: a semiprime: 3 × 15511, the product of two primes.
- 2
46533 is composite. Its prime factorisation is
- 3
The divisors add up to 62048; without 46533 itself that is 15515, so 46533 is deficient (15515 is less than 46533). Euler's totient φ(46533) = 31020 numbers up to 46533 share no factor with it.
- 4
The digits of 46533 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 52 steps to reach 1.
LaTeX source of the formulas on this page
\[ 46533 = 3 \times 15511 \]
46533 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 62048 |
| Euler totient φ(n) | 31020 |
| Square | 2165320089 |
| Cube | 100758839701437 |
| Square root | 215.715090 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 52 |
| Scientific notation | 4.6533 × |
46533 in other forms
| Form | Value |
|---|---|
| In words | forty-six thousand five hundred and thirty-three |
| Binary (base 2) | 1011010111000101 |
| Octal (base 8) | 132705 |
| Hexadecimal (base 16) | B5C5 |
| Base 3 | 2100211110 |
| As time | 46533 seconds = 12 h 55 min 33 s |
Is 46533 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 (46533 ÷ 3 = 15511) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | 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 4) | 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 5) | 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 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 46533 a prime number?
No. 46533 = 3 × 15511, so it is divisible by 3.
What are the factors of 46533?
1, 3, 15511, 46533.
What is 46533 in binary?
1011010111000101 (hexadecimal B5C5, octal 132705).
What is the square root of 46533?
About 215.7151.
Is 46533 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 46533?
46533 is a semiprime: 3 × 15511, the product of two primes.