Properties of the Number 14372

Fourteen Thousand Three Hundred Seventy-Two

Basics

Value: 14371 → 14372 → 14373

Parity: even

Prime: No

Previous Prime: 14369

Next Prime: 14387

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 2 ² × 3593

Divisors: 1, 2, 4, 3593, 7186, 14372

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11100000100100

Octal: 34044

Duodecimal: 8398

Hexadecimal: 3824

Square: 206554384

Square Root: 119.88327656516567

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) = number of AVL trees of height n with k (leaf-) nodes, n>=0, fibonacci(n+2)<=k<=2ⁿ. A143897

Triangle read by columns: T(n,k) = number of AVL trees of height n with k (leaf-) nodes, k>=1, A029837(k)<=n<A072649(k). A217298

a(n) = 9·Fibonacci(2n+1) - 1. A153873

Number of height minimal AVL trees with n (leaf-) nodes. A217299

Numbers n such that n² is a sum of 2 and also of 4 consecutive primes. A252066

Shapes of height-balanced AVL trees of height at most 5 with n nodes. A36662

Bessel function J₀(n) is a monotonically decreasing positive sequence. A46960

Permanent of the symmetric n X n matrix M defined by M(i,j) = gcd(i,j) for 1 <= i,j <= n. A85244

Irregular triangle read by rows: T(n,k) is the number of permutations in S_n having k stretching pairs. A216120

Number of n X 3 0..1 arrays with rows, diagonals and antidiagonals unimodal and columns nondecreasing. A223833