The number 46251
46251 is a composite number with 10 divisors. Its prime factorisation is × 571. Divisors (10): 1, 3, 9, 27, 81, 571, 1713, 5139, 15417, 46251.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 46251: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
46251 is composite. Its prime factorisation is
- 3
The divisors add up to 69212; without 46251 itself that is 22961, so 46251 is deficient (22961 is less than 46251). Euler's totient φ(46251) = 30780 numbers up to 46251 share no factor with it.
- 4
The digits of 46251 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 145 steps to reach 1.
LaTeX source of the formulas on this page
\[ 46251 = 3^{4} \times 571 \]46251 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 10 |
| Sum of divisors | 69212 |
| Euler totient φ(n) | 30780 |
| Square | 2139155001 |
| Cube | 98938057951251 |
| Square root | 215.060457 (= 9√571) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 145 |
| Scientific notation | 4.6251 × |
46251 in other forms
| Form | Value |
|---|---|
| In words | forty-six thousand two hundred and fifty-one |
| Binary (base 2) | 1011010010101011 |
| Octal (base 8) | 132253 |
| Hexadecimal (base 16) | B4AB |
| Base 3 | 2100110000 |
| As time | 46251 seconds = 12 h 50 min 51 s |
Is 46251 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 (46251 ÷ 3 = 15417) | 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 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 | Yes (46251 ÷ 9 = 5139) | 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 7) | 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 46251 a prime number?
No. 46251 = × 571, so it is divisible by 3.
What are the factors of 46251?
1, 3, 9, 27, 81, 571, 1713, 5139, 15417, 46251.
What is 46251 in binary?
1011010010101011 (hexadecimal B4AB, octal 132253).
What is the square root of 46251?
About 215.0605, exactly 9√571.
Is 46251 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 46251?
46251 is a happy number: repeatedly adding the squares of its digits reaches 1.