The number 46033
46033 is a composite number with 4 divisors. Its prime factorisation is 13 × 3541. Divisors (4): 1, 13, 3541, 46033.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 46033: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 13 × 3541, the product of two primes.
- 2
46033 is composite. Its prime factorisation is
- 3
The divisors add up to 49588; without 46033 itself that is 3555, so 46033 is deficient (3555 is less than 46033). Euler's totient φ(46033) = 42480 numbers up to 46033 share no factor with it.
- 4
The digits of 46033 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 132 steps to reach 1.
LaTeX source of the formulas on this page
\[ 46033 = 13 \times 3541 \]
46033 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 49588 |
| Euler totient φ(n) | 42480 |
| Square | 2119037089 |
| Cube | 97545634317937 |
| Square root | 214.553024 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 132 |
| Scientific notation | 4.6033 × |
46033 in other forms
| Form | Value |
|---|---|
| In words | forty-six thousand and thirty-three |
| Binary (base 2) | 1011001111010001 |
| Octal (base 8) | 131721 |
| Hexadecimal (base 16) | B3D1 |
| Base 3 | 2100010221 |
| As time | 46033 seconds = 12 h 47 min 13 s |
Is 46033 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 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 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 1) | 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 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 46033 a prime number?
No. 46033 = 13 × 3541, so it is divisible by 13.
What are the factors of 46033?
1, 13, 3541, 46033.
What is 46033 in binary?
1011001111010001 (hexadecimal B3D1, octal 131721).
What is the square root of 46033?
About 214.5530.
Is 46033 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 46033?
46033 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 13 × 3541, the product of two primes.