Properties of the Number 51064

Fifty-One Thousand Sixty-Four

Basics

Value: 51063 → 51064 → 51065

Parity: even

Prime: No

Previous Prime: 51061

Next Prime: 51071

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 2 ³ × 13 × 491

Divisors: 1, 2, 4, 8, 13, 26, 52, 104, 491, 982

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1100011101111000

Octal: 143570

Duodecimal: 25674

Hexadecimal: c778

Square: 2607532096

Square Root: 225.97344976788756

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)=Number of (n+2)X(k+2) 0..1 arrays with every 3X3 subblock sum of the medians of the diagonal and antidiagonal minus the two sums of the central row and column nondecreasing horizontally, vertically and ne-to-sw antidiagonally. A255756

Triangle, read by rows, equal to the matrix inverse of P=A113370. A114156

Number of (n+2) X (n+2) 0..1 arrays with every 3 X 3 subblock sum of the medians of the diagonal and antidiagonal minus the two sums of the central row and column nondecreasing horizontally, vertically and ne-to-sw antidiagonally. A255749

Number of (n+2)X(3+2) 0..1 arrays with every 3X3 subblock sum of the medians of the diagonal and antidiagonal minus the two sums of the central row and column nondecreasing horizontally, vertically and ne-to-sw antidiagonally. A255751

Number of (3+2)X(n+2) 0..1 arrays with every 3X3 subblock sum of the medians of the diagonal and antidiagonal minus the two sums of the central row and column nondecreasing horizontally, vertically and ne-to-sw antidiagonally. A255758

a(n) = ∑_k=0..n binomial(n+k-1,k) * (k! * Stirling1(n,k))². A382853

a(n) = C(n+1) - C(n-1) - 2·C(n-2) where C(n) = A000108(n) are the Catalan numbers. A382668

a(n) = a(n-1) + a(n-2) + a(n-3), with a(1) = 4, a(2) = 13, a(3) = 42. A385717

3^a(n) exactly divides 3n. Or, 3-adic valuation of 3n. A51064

Largest value in trajectory when the following modified juggler map is iterated: a[n]=(1-Mod[n, 2])*Floor[n^3/4]+Mod[n, 2]*Floor[n^4/3]; original exponents {1/2, 3/2} are replaced with {3/4, 4/3}. A95400