Properties of the Number 26372

Twenty-Six Thousand Three Hundred Seventy-Two

Basics

Value: 26371 → 26372 → 26373

Parity: even

Prime: No

Previous Prime: 26371

Next Prime: 26387

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 2 ² × 19 × 347

Divisors: 1, 2, 4, 19, 38, 76, 347, 694, 1388, 6593

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110011100000100

Octal: 63404

Duodecimal: 13318

Hexadecimal: 6704

Square: 695482384

Square Root: 162.39458119038332

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 unlabeled connected loopless multigraphs with n edges rooted at one distinguished vertex. A339036

Number of (w,x,y,z) with all terms in {1,...,n} and |x-y| = w + |y-z|. A212683

Number of partitions p of n such that mean(p) < multiplicity(min(p)). A240203

Expansion of 1/(sqrt(1-2·x-3·x²)*(2-M(x))), where M(x) is the g.f. of the Motzkin numbers A001006. A116387

Triangle read by rows: T(n,k) (0<=k<=n) is the number of Delannoy paths of length n, having k (1,1)-steps on the line y=x (a Delannoy path of length n is a path from (0,0) to (n,n), consisting of steps (E=1,0), N=(0,1) and D(1,1)). A109979

Number of (n+3) X 10 0..1 matrices with each 4 X 4 subblock idempotent. A224567

Permutation of natural numbers: a(1) = 1, a(n) = A064989(n)-th integer among those positive integers not occurring earlier in the sequence. [A064989(n) shifts the prime factorization of n one step right]. A246165

a(n) = greatest k such that s(k) = n, where s = A026370. A26372