The number 4181
4181 is a Fibonacci number. Its prime factorisation is 37 × 113. Divisors (4): 1, 37, 113, 4181.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 4181: a Fibonacci number; a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 37 × 113, the product of two primes.
- 2
4181 is composite. Its prime factorisation is
- 3
The divisors add up to 4332; without 4181 itself that is 151, so 4181 is deficient (151 is less than 4181). Euler's totient φ(4181) = 4032 numbers up to 4181 share no factor with it.
- 4
The digits of 4181 add up to 14, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 33 steps to reach 1.
LaTeX source of the formulas on this page
\[ 4181 = 37 \times 113 \]
4181 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 4332 |
| Euler totient φ(n) | 4032 |
| Square | 17480761 |
| Cube | 73087061741 |
| Square root | 64.660653 |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 33 |
| Scientific notation | 4.181 × |
4181 in other forms
| Form | Value |
|---|---|
| In words | four thousand one hundred and eighty-one |
| Binary (base 2) | 1000001010101 |
| Octal (base 8) | 10125 |
| Hexadecimal (base 16) | 1055 |
| Base 3 | 12201212 |
| As time | 4181 seconds = 1 h 9 min 41 s |
Is 4181 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 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 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | 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 1) | 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 4181 a prime number?
No. 4181 = 37 × 113, so it is divisible by 37.
What are the factors of 4181?
1, 37, 113, 4181.
What is 4181 in binary?
1000001010101 (hexadecimal 1055, octal 10125).
What is the square root of 4181?
About 64.6607.
Is 4181 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 4181?
4181 is a Fibonacci number; a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 37 × 113, the product of two primes.