The number 46469
46469 is a composite number with 4 divisors. Its prime factorisation is 31 × 1499. Divisors (4): 1, 31, 1499, 46469.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 46469: a semiprime: 31 × 1499, the product of two primes.
- 2
46469 is composite. Its prime factorisation is
- 3
The divisors add up to 48000; without 46469 itself that is 1531, so 46469 is deficient (1531 is less than 46469). Euler's totient φ(46469) = 44940 numbers up to 46469 share no factor with it.
- 4
The digits of 46469 add up to 29, 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.
LaTeX source of the formulas on this page
\[ 46469 = 31 \times 1499 \]
46469 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 48000 |
| Euler totient φ(n) | 44940 |
| Square | 2159367961 |
| Cube | 100343669779709 |
| Square root | 215.566695 |
| Digit sum / digital root | 29 / 2 |
| Collatz steps to 1 | 145 |
| Scientific notation | 4.6469 × |
46469 in other forms
| Form | Value |
|---|---|
| In words | forty-six thousand four hundred and sixty-nine |
| Binary (base 2) | 1011010110000101 |
| Octal (base 8) | 132605 |
| Hexadecimal (base 16) | B585 |
| Base 3 | 2100202002 |
| As time | 46469 seconds = 12 h 54 min 29 s |
Is 46469 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 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 4) | 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 3) | 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 5) | 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 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 46469 a prime number?
No. 46469 = 31 × 1499, so it is divisible by 31.
What are the factors of 46469?
1, 31, 1499, 46469.
What is 46469 in binary?
1011010110000101 (hexadecimal B585, octal 132605).
What is the square root of 46469?
About 215.5667.
Is 46469 divisible by 3?
No. Its digits add up to 29, which is not a multiple of 3.
What is special about the number 46469?
46469 is a semiprime: 31 × 1499, the product of two primes.