The number 46451
46451 is the 4801st prime number. Its only divisors are 1 and 46451.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 46451: the 4801st prime number; a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
46451 is prime, so its only factors are 1 and 46451. It is the 4801st prime; the next prime is 46457 and the one before is 46447.
- 3
The divisors add up to 46452; without 46451 itself that is 1, so 46451 is deficient (1 is less than 46451). Euler's totient φ(46451) = 46450 numbers up to 46451 share no factor with it.
- 4
The digits of 46451 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 145 steps to reach 1.
46451 at a glance
| Property | Value |
|---|---|
| Type | prime |
| Number of divisors | 2 |
| Sum of divisors | 46452 |
| Euler totient φ(n) | 46450 |
| Square | 2157695401 |
| Cube | 100227109071851 |
| Square root | 215.524941 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 145 |
| Scientific notation | 4.6451 × |
46451 in other forms
| Form | Value |
|---|---|
| In words | forty-six thousand four hundred and fifty-one |
| Binary (base 2) | 1011010101110011 |
| Octal (base 8) | 132563 |
| Hexadecimal (base 16) | B573 |
| Base 3 | 2100201102 |
| As time | 46451 seconds = 12 h 54 min 11 s |
Is 46451 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 2) | 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 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 2) | 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 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 46451 a prime number?
Yes. 46451 is divisible only by 1 and itself.
What are the factors of 46451?
1, 46451.
What is 46451 in binary?
1011010101110011 (hexadecimal B573, octal 132563).
What is the square root of 46451?
About 215.5249.
Is 46451 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 46451?
46451 is the 4801st prime number; a happy number: repeatedly adding the squares of its digits reaches 1.