The number 46267
46267 is a composite number with 4 divisors. Its prime factorisation is 13 × 3559. Divisors (4): 1, 13, 3559, 46267.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 46267: a semiprime: 13 × 3559, the product of two primes.
- 2
46267 is composite. Its prime factorisation is
- 3
The divisors add up to 49840; without 46267 itself that is 3573, so 46267 is deficient (3573 is less than 46267). Euler's totient φ(46267) = 42696 numbers up to 46267 share no factor with it.
- 4
The digits of 46267 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 163 steps to reach 1.
LaTeX source of the formulas on this page
\[ 46267 = 13 \times 3559 \]
46267 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 49840 |
| Euler totient φ(n) | 42696 |
| Square | 2140635289 |
| Cube | 99040772916163 |
| Square root | 215.097652 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 163 |
| Scientific notation | 4.6267 × |
46267 in other forms
| Form | Value |
|---|---|
| In words | forty-six thousand two hundred and sixty-seven |
| Binary (base 2) | 1011010010111011 |
| Octal (base 8) | 132273 |
| Hexadecimal (base 16) | B4BB |
| Base 3 | 2100110121 |
| As time | 46267 seconds = 12 h 51 min 7 s |
Is 46267 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 2) | 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 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 3) | 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 7) | 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 46267 a prime number?
No. 46267 = 13 × 3559, so it is divisible by 13.
What are the factors of 46267?
1, 13, 3559, 46267.
What is 46267 in binary?
1011010010111011 (hexadecimal B4BB, octal 132273).
What is the square root of 46267?
About 215.0977.
Is 46267 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 46267?
46267 is a semiprime: 13 × 3559, the product of two primes.