Properties of the Number 5736

Five Thousand Seven Hundred Thirty-Six

Basics

Value: 5735 → 5736 → 5737

Parity: even

Prime: No

Previous Prime: 5717

Next Prime: 5737

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 2 ³ × 3 × 239

Divisors: 1, 2, 3, 4, 6, 8, 12, 24, 239, 478

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 1011001101000

Octal: 13150

Duodecimal: 33A0

Hexadecimal: 1668

Square: 32901696

Square Root: 75.73638491504595

Classification

Fibonacci: No

Bell Number: No

Factorial Number: No

Regular Number: No

Perfect Number: No

Special

Kaprekar Constant: No

Munchausen Constant: No

Armstrong Number: No

Kaprekar Number: No

Catalan Number: No

Vampire Number: No

Taxicab Number: No

Super Prime: No

Friedman Number: No

Fermat Number: No

Cullen Number: No

OEIS Sequences

Square array A(n,k), n >= 0, k >= 0, read by antidiagonals, where column k is the expansion of ∏_j>=1 1/(1 - j·x^j)^k. A297328

Base-2 expansion of a(n) encodes the steps where numbers of the form 4k+3 are encountered when map x -> A252463(x) is iterated down to 1, starting from x=n. A292383

a(1)=3, a(2)=4, a(n) = 3·a(n-1) + 4·a(n-2). A189738

Sum of gcd(x, y) for 1 <= x, y <= n. A18806

Alternating sum of the squares of the first n Fibonacci numbers. A119283

Decimal part of cube root of n starts with 9: first term of runs. A34135

Numbers n such that n²+n+41 (Euler's "prime generating polynomial") is not squarefree. A97823

T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with no 2X2 subblock summing to less than 4. A184564

T(n,k)=Number of (n+2)X(k+2) binary arrays avoiding patterns 001 and 010 in rows and columns. A202616

Numbers k for which 2·k-1, 4·k-1 and 8·k-1 are primes. A124493