Properties of the Number 26368

Twenty-Six Thousand Three Hundred Sixty-Eight

Basics

Value: 26367 → 26368 → 26369

Parity: even

Prime: No

Previous Prime: 26357

Next Prime: 26371

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 2 ⁸ × 103

Divisors: 1, 2, 4, 8, 16, 32, 64, 103, 128, 206

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: Yes

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110011100000000

Octal: 63400

Duodecimal: 13314

Hexadecimal: 6700

Square: 695271424

Square Root: 162.3822650414755

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

Number of non-vanishing Feynman diagrams of order 2n for the electron or the photon propagators in quantum electrodynamics. A5411

Number of integer partitions of 2n whose distinct parts sum to n. A364910

Products of the 8th power of a prime and a distinct prime (p⁸*q). A179668

Values of n such that there are exactly 7 solutions to x² - y² = n with x > y >= 0. A257414

A(n,k) is the sum over all Dyck paths of semilength n of products over all peaks p of (x_p+k·y_p)/y_p, where x_p and y_p are the coordinates of peak p; square array A(n,k), n>=0, k>=0, read by antidiagonals. A258219

T(n,k) = 1/k! * ∑_i=0..k (-1)^k-i *C(k,i) * A258219(n,i); triangle T(n,k), n>=0, 0<=k<=n, read by rows. A258220

Decimal representation of the x-axis, from the origin to the right edge, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 313", based on the 5-celled von Neumann neighborhood. A281042

a(n) = (n+1)*(6·n⁴ - 51·n³ + 161·n² - 251·n + 251). A165281

Expansion of ∏_k>=1 1/((1 - x^2·k-1)^k*(5·k-3/2)*(1 - x^2·k)^k*(5·k+3/2)). A294654

Square array A(n,k), n >= 0, k >= 1, read by antidiagonals: A(n,k) = exp(1/k) * ∑_j>=0 (k·j + 1)ⁿ / ((-k)^j * j!). A334192