Properties of the Number 14014

Fourteen Thousand Fourteen

Basics

Value: 14013 → 14014 → 14015

Parity: even

Prime: No

Previous Prime: 14011

Next Prime: 14029

Digit Sum: 10

Digital Root: 1

Palindrome: No

Factorization: 2 × 7 ² × 11 × 13

Divisors: 1, 2, 7, 11, 13, 14, 22, 26, 49, 77

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11011010111110

Octal: 33276

Duodecimal: 813A

Hexadecimal: 36be

Square: 196392196

Square Root: 118.38074167701434

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

Triangle read by rows: T(n, k) is the number of diagonal dissections of a convex n-gon into k+1 regions. A33282

Triangle obtained by adding a leading diagonal 1,0,0,0,... to A033282. A86810

Place n equally-spaced points around a circle and join every pair of points by a chord; this divides the circle into a(n) regions. A6533

Triangle read by rows: T(n,k) is the number of Schroeder paths of semilength n containing exactly k peaks but no peaks at level one (n >= 1; 0 <= k <= n-1). A126216

a(n) = A026618(2·n, n-2). A26618

Each permutation in the list A060117 converted to Site Swap notation, with digits reversed and inverted. "Zero throws" (fixed elements) indicated with 0's. A60498

Triangle read by rows: T(n,k) is the number of short bushes with n edges and k branchnodes (i.e., nodes of outdegree at least two). A short bush is an ordered tree with no nodes of outdegree 1. A108263

Numbers that are not a power of a prime but whose prime indices satisfy (mean) = (median) = (mode), assuming there is a unique mode. A363729

Even elements in the 5-Pascal triangle A028313. A28317

Triangle (read by rows) with row sums = Motzkin sums (also called Riordan numbers) (A005043): T(n,s) = (1/n)*C(n,s)*(C(n-s,s+1) - C(n-s-2,s-1)). A132081