The number 46152
46152 is a composite number with 24 divisors. Its prime factorisation is × × 641. Divisors (24): 1, 2, 3, 4, 6, 8, 9, 12, 18, 24, 36, 72, 641, 1282, 1923, 2564 … 46152.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 46152: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 18.
- 2
46152 is composite. Its prime factorisation is
- 3
The divisors add up to 125190; without 46152 itself that is 79038, so 46152 is abundant (79038 is more than 46152). Euler's totient φ(46152) = 15360 numbers up to 46152 share no factor with it.
- 4
The digits of 46152 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 176 steps to reach 1.
LaTeX source of the formulas on this page
\[ 46152 = 2^{3} \times 3^{2} \times 641 \]46152 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 125190 |
| Euler totient φ(n) | 15360 |
| Square | 2130007104 |
| Cube | 98304087863808 |
| Square root | 214.830165 (= 6√1282) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 176 |
| Scientific notation | 4.6152 × |
46152 in other forms
| Form | Value |
|---|---|
| In words | forty-six thousand one hundred and fifty-two |
| Binary (base 2) | 1011010001001000 |
| Octal (base 8) | 132110 |
| Hexadecimal (base 16) | B448 |
| Base 3 | 2100022100 |
| As time | 46152 seconds = 12 h 49 min 12 s |
Is 46152 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (46152 ÷ 2 = 23076) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (46152 ÷ 3 = 15384) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (46152 ÷ 4 = 11538) | 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 | Yes (46152 ÷ 6 = 7692) | 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 | Yes (46152 ÷ 8 = 5769) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (46152 ÷ 9 = 5128) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 2) | 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 | Yes (46152 ÷ 12 = 3846) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 46152 a prime number?
No. 46152 = × × 641, so it is divisible by 2.
What are the factors of 46152?
1, 2, 3, 4, 6, 8, 9, 12, 18, 24, 36, 72, 641, 1282, 1923, 2564, 3846, 5128, 5769, 7692, 11538, 15384, 23076, 46152.
What is 46152 in binary?
1011010001001000 (hexadecimal B448, octal 132110).
What is the square root of 46152?
About 214.8302, exactly 6√1282.
Is 46152 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 46152?
46152 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 18.