The number 46951
46951 is a composite number with 4 divisors. Its prime factorisation is 29 × 1619. Divisors (4): 1, 29, 1619, 46951.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 46951: a semiprime: 29 × 1619, the product of two primes.
- 2
46951 is composite. Its prime factorisation is
- 3
The divisors add up to 48600; without 46951 itself that is 1649, so 46951 is deficient (1649 is less than 46951). Euler's totient φ(46951) = 45304 numbers up to 46951 share no factor with it.
- 4
The digits of 46951 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 158 steps to reach 1.
LaTeX source of the formulas on this page
\[ 46951 = 29 \times 1619 \]
46951 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 48600 |
| Euler totient φ(n) | 45304 |
| Square | 2204396401 |
| Cube | 103498615423351 |
| Square root | 216.681794 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 158 |
| Scientific notation | 4.6951 × |
46951 in other forms
| Form | Value |
|---|---|
| In words | forty-six thousand nine hundred and fifty-one |
| Binary (base 2) | 1011011101100111 |
| Octal (base 8) | 133547 |
| Hexadecimal (base 16) | B767 |
| Base 3 | 2101101221 |
| As time | 46951 seconds = 13 h 2 min 31 s |
Is 46951 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 1) | 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 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 7) | 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 1) | 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 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 46951 a prime number?
No. 46951 = 29 × 1619, so it is divisible by 29.
What are the factors of 46951?
1, 29, 1619, 46951.
What is 46951 in binary?
1011011101100111 (hexadecimal B767, octal 133547).
What is the square root of 46951?
About 216.6818.
Is 46951 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 46951?
46951 is a semiprime: 29 × 1619, the product of two primes.