Properties of the Number 65226

Sixty-Five Thousand Two Hundred Twenty-Six

Basics

Value: 65225 → 65226 → 65227

Parity: even

Prime: No

Previous Prime: 65213

Next Prime: 65239

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 2 × 3 × 7 × 1553

Divisors: 1, 2, 3, 6, 7, 14, 21, 42, 1553, 3106

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1111111011001010

Octal: 177312

Duodecimal: 318B6

Hexadecimal: feca

Square: 4254431076

Square Root: 255.3938135507593

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 T(n,k) (n >= 1, k >= 0) read by antidiagonals: coordination sequence for root lattice A_n. A103881

Number A(n,k) of sequences with k copies each of 1,2,...,n avoiding absolute differences between adjacent elements larger than one; square array A(n,k), n>=0, k>=0, read by antidiagonals. A331562

T(n,k)=Number of length n+4 0..k arrays with no five consecutive terms having the maximum of any two terms equal to the minimum of the remaining three terms. A249844

a(n) = ∑_i=0..n C(n+1,i)*C(n-1,i-1)*C(2n-i,n). A103882

Coordination sequence for A₆ lattice. A8387

Number of permutations of 6 copies of 1..n with all adjacent differences <= 1 in absolute value. A177304

Number of integer sequences of length n+1 with sum zero and sum of absolute values 12. A157055

Number of length n+4 0..6 arrays with no five consecutive terms having the maximum of any two terms equal to the minimum of the remaining three terms. A249842

Number of length 2+4 0..n arrays with no five consecutive terms having the maximum of any two terms equal to the minimum of the remaining three terms. A249846

Triangle read by rows in which T(n,k) is the number of length k chains from (0,0) to (n,n) of the poset [n] X [n] ordered by the product order, 0 <= k <= 2n, n>=0. A316649