Properties of the Number 40264

Forty Thousand Two Hundred Sixty-Four

Basics

Value: 40263 → 40264 → 40265

Parity: even

Prime: No

Previous Prime: 40253

Next Prime: 40277

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 2 ³ × 7 × 719

Divisors: 1, 2, 4, 7, 8, 14, 28, 56, 719, 1438

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1001110101001000

Octal: 116510

Duodecimal: 1B374

Hexadecimal: 9d48

Square: 1621189696

Square Root: 200.65891457894415

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) = 1/4 the number of (n+1) X (k+1) binary arrays with equal numbers of 2 X 2 subblocks with sums 1 and 3. A184604

Number of isomorphism classes of connected 5-regular multigraphs of order 2n, loops allowed. A129430

T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every consecutive three elements in every row, column, diagonal and antidiagonal having exactly two distinct values, and new values 0 upwards introduced in row major order. A253044

a(n) = a(n-1) + a(n-2) + 3·a(n-4) - 2·a(n-5) for n >= 5, where a(0) = 2, a(1) = 4, a(2) = 8, a(3) = 13, a(4) = 26. A288925

Number of UU's (i.e., doublerises) in all skew Dyck paths of semilength n. A128743

1/4 the number of (n+1) X 2 binary arrays with equal numbers of 2 X 2 subblocks with sums 1 and 3. A184596

Number of (n+2)X(2+2) 0..3 arrays with every consecutive three elements in every row, column, diagonal and antidiagonal having exactly two distinct values, and new values 0 upwards introduced in row major order. A253038

Triangle T(n,k) read by rows (n >= 0, k >= 0) with g.f. 1/(1 - f(0)*x - x·y/(1 - f(1)*x - x·y/(1 - f(2)*x - x·y/(1 - f(3)*x - x·y/(1 - f(4)*x - x·y/(1 - ...)))))) where f(n) = n + 1 for n >= 0. A383019

a(n) = n! - binomial(n,3). A129949

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, -1), (-1, 1, 1), (0, 0, 1), (0, 1, 0), (1, 0, 0)}. A151048