Properties of the Number 16323

Sixteen Thousand Three Hundred Twenty-Three

Basics

Value: 16322 → 16323 → 16324

Parity: odd

Prime: No

Previous Prime: 16319

Next Prime: 16333

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 3 × 5441

Divisors: 1, 3, 5441, 16323

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11111111000011

Octal: 37703

Duodecimal: 9543

Hexadecimal: 3fc3

Square: 266440329

Square Root: 127.7614965472775

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)=Petersen graph (3,1) coloring a rectangular array: number of nXk 0..5 arrays where 0..5 label nodes of a graph with edges 0,1 0,3 3,5 3,4 1,2 1,4 4,5 2,0 2,5 and every array movement to a horizontal, diagonal or antidiagonal neighbor moves along an edge of this graph, with the array starting at 0. A223504

Spontaneous magnetization coefficients for square lattice spin 3/2 Ising model. A10105

Decimal representation of the diagonal from the corner to the origin of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 395", based on the 5-celled von Neumann neighborhood. A287985

Number of non-perfect-powers·in the range 2ⁿ < x < 2ⁿ⁺¹. A377701

Spontaneous magnetization coefficients for square lattice spin 3/2 Ising model. A30120

Row sums of triangle A132733. A132734

Partial sums of A165271. A165273

Lesser of 2 successive squarefree semiprimes (k, k+4) sandwiching 3 consecutive nonsquarefree numbers. A363821

a(n) = ∑_t=0..n g(t)*g(n-t) where g(t) = A002121(t). A2122

Petersen graph (3,1) coloring a rectangular array: number of nX4 0..5 arrays where 0..5 label nodes of a graph with edges 0,1 0,3 3,5 3,4 1,2 1,4 4,5 2,0 2,5 and every array movement to a horizontal, diagonal or antidiagonal neighbor moves along an edge of this graph, with the array starting at 0. A223500