Properties of the Number 4322

Four Thousand Three Hundred Twenty-Two

Basics

Value: 4321 → 4322 → 4323

Parity: even

Prime: No

Previous Prime: 4297

Next Prime: 4327

Digit Sum: 11

Digital Root: 2

Palindrome: No

Factorization: 2 × 2161

Divisors: 1, 2, 2161, 4322

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1000011100010

Octal: 10342

Duodecimal: 2602

Hexadecimal: 10e2

Square: 18679684

Square Root: 65.7419196555744

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

Coordination sequence for 3D uniform tiling formed by stacking parallel layers of the 3⁴.6 2D tiling (cf. A250120). A299254

a(n) = 2·n² + 6·n + 2. A90288

Number T(n,k) of equivalence classes of ways of placing k 3 X 3 tiles in an n X 7 rectangle under all symmetry operations of the rectangle; irregular triangle T(n,k), n>=3, 0<=k<=2·floor(n/3), read by rows. A238556

Expansion of e.g.f. 1/(1 - 2·sinh(x)). A557

T(n,k) is the number of n X n 0..k arrays with row and column sums equal. A202784

T(n,k) = Half the number of lower triangles of an (n+1) X (n+1) 0..k array with no element equal to the average of its horizontal and vertical neighbors. A194615

T(n,k)=Number of 0..k arrays x(0..n-1) of n elements with each no smaller than the sum of its two previous neighbors modulo (k+1). A207100

Sum of the sixth largest parts of the partitions of n into 10 squarefree parts. A326632

Numbers that are the sum of seven fourth powers in three or more ways. A345569

Numbers that are the sum of seven fourth powers in exactly three ways. A345825