The number 5436
5436 is a composite number with 18 divisors. Its prime factorisation is × × 151. Divisors (18): 1, 2, 3, 4, 6, 9, 12, 18, 36, 151, 302, 453, 604, 906, 1359, 1812 … 5436.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 5436: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 18.
- 2
5436 is composite. Its prime factorisation is
- 3
The divisors add up to 13832; without 5436 itself that is 8396, so 5436 is abundant (8396 is more than 5436). Euler's totient φ(5436) = 1800 numbers up to 5436 share no factor with it.
- 4
The digits of 5436 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 67 steps to reach 1.
LaTeX source of the formulas on this page
\[ 5436 = 2^{2} \times 3^{2} \times 151 \]5436 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 18 |
| Sum of divisors | 13832 |
| Euler totient φ(n) | 1800 |
| Square | 29550096 |
| Cube | 160634321856 |
| Square root | 73.729234 (= 6√151) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 67 |
| Scientific notation | 5.436 × |
5436 in other forms
| Form | Value |
|---|---|
| In words | five thousand four hundred and thirty-six |
| Binary (base 2) | 1010100111100 |
| Octal (base 8) | 12474 |
| Hexadecimal (base 16) | 153C |
| Base 3 | 21110100 |
| As time | 5436 seconds = 1 h 30 min 36 s |
Is 5436 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (5436 ÷ 2 = 2718) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (5436 ÷ 3 = 1812) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (5436 ÷ 4 = 1359) | 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 | Yes (5436 ÷ 6 = 906) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (5436 ÷ 9 = 604) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 6) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (5436 ÷ 12 = 453) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 5436 a prime number?
No. 5436 = × × 151, so it is divisible by 2.
What are the factors of 5436?
1, 2, 3, 4, 6, 9, 12, 18, 36, 151, 302, 453, 604, 906, 1359, 1812, 2718, 5436.
What is 5436 in binary?
1010100111100 (hexadecimal 153C, octal 12474).
What is the square root of 5436?
About 73.7292, exactly 6√151.
Is 5436 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 5436?
5436 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 18.