Properties of the Number 14272

Fourteen Thousand Two Hundred Seventy-Two

Basics

Value: 14271 → 14272 → 14273

Parity: even

Prime: No

Previous Prime: 14251

Next Prime: 14281

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 2 ⁶ × 223

Divisors: 1, 2, 4, 8, 16, 32, 64, 223, 446, 892

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11011111000000

Octal: 33700

Duodecimal: 8314

Hexadecimal: 37c0

Square: 203689984

Square Root: 119.46547618454463

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 partitions of n having no parts with multiplicity 9. A184644

T(n,k)=Number of (n+1)X(k+1) 0..6 arrays with every 2X2 subblock having the sum of the squares of the edge differences equal to 30 (30 maximizes T(1,1)), and no two adjacent values equal. A233892

Theorems from propositional calculus, translated into decimal digits. A101273

Number T(n,k) of binary search trees of height k having n internal nodes; triangle T(n,k), n>=0, max(0,floor(log₂(n))+1)<=k<=n, read by rows. A335919

T(n,k) is the number of permutations of [n] having exactly k pairs of integers i<j in [n] such that their cycle minima have opposite sorting order; triangle T(n,k), n>=0, 0<=k<=A125811(n)-1, read by rows. A381529

Upper triangular region of the table A073345. A73429

Number of plane binary trees of size n+3 and height n. A73774

Triangle read by row. The reduced triangle of the partition_triangle A355776. A356116

Place a point on the integer coordinates, up to |n|, along all four axial directions on a Cartesian plane, and then join an infinite straight line between every pair of points: a(n) is the number of finite regions created in the resulting graph. A386560

Triangle read by rows: coefficients of rook polynomials. A259985