Properties of the Number 52328

Fifty-Two Thousand Three Hundred Twenty-Eight

Basics

Value: 52327 → 52328 → 52329

Parity: even

Prime: No

Previous Prime: 52321

Next Prime: 52361

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 2 ³ × 31 × 211

Divisors: 1, 2, 4, 8, 31, 62, 124, 211, 248, 422

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: 1100110001101000

Octal: 146150

Duodecimal: 26348

Hexadecimal: cc68

Square: 2738219584

Square Root: 228.75314205492347

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

T(n,k) is the number of (n+1) X (k+1) 0..5 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 5, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings). A235186

Quadrinomial coefficients: C(2+n,n) + C(3+n,n) + C(4+n,n). A5718

G.f.: exp( ∑_n>=1 A001511(n)*2^A001511(n)*xⁿ/n ) where A001511(n) equals the 2-adic valuation of 2n. A183036

Numbers k such that σ(σ(k)) == φ(k) (mod σ(k)). A67204

G.f. is the polynomial (∏_k=1..32 (1 - x^3·k))/(1-x)³². A162739

Number of (n+1) X (3+1) 0..5 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 5, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings). A235181

Number of (n+1) X (6+1) 0..5 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 5, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings). A235184

Second component B of the pairs (A, B) from A389379. A389390

Number of rooted trees with a forbidden limb of length 5. A52328

a(0)=1, a(1)=2, a(n) = (a(n-2)*a(n-1)+1) mod n. A182458