Properties of the Number 14692

Fourteen Thousand Six Hundred Ninety-Two

Basics

Value: 14691 → 14692 → 14693

Parity: even

Prime: No

Previous Prime: 14683

Next Prime: 14699

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 2 ² × 3673

Divisors: 1, 2, 4, 3673, 7346, 14692

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11100101100100

Octal: 34544

Duodecimal: 8604

Hexadecimal: 3964

Square: 215854864

Square Root: 121.21056059601408

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 semi-lone-child-avoiding rooted trees with n unlabeled vertices. A331934

Number of ways to remove n oranges from an infinite stack of oranges whose m-th layer is an m X (m+1) rectangle. A274594

Number T(n,k) of tilings of a 5 X n rectangle with pentominoes of any shape and exactly k pentominoes of shape Y; triangle T(n,k), n>=0, read by rows. A247712

Polynomial (1/3)*n³ + (9/2)*n² + (85/6)*n - 2. A73775

Number of n-digit 5th powers. A216655

Number of tilings of a 5 X n rectangle using n pentominoes of any but the Y shape. A247776

Composite numbers k such that the sum of the proper divisors of k not including 1, (Chowla's function, A048050) and their product (A007956) are both perfect squares. A64180

Factorable subsets: the number of proper subsets S of {1,2,...,n} that can be expressed in the form S=A·B, where S is defined to be the set {a(i)*b(j)| a(i) in A, b(j) in B}. A68594

Number of nondecreasing integer sequences of length 11 with sum zero and sum of absolute values 2n. A158145

The PolyLog functional part of A008292 (the Eulerian numbers) is treated as a curvature to give a set of polynomial triangle sequence coefficients: p(x,n)=Sum[A008292(n,m)*x^m-1,{m,0,n}]; q(x,n)=k from Solve[FullSimplify[ExpandAll[p[x, n]/(x - 1)ⁿ]] - (1 + k/x²) == 0, k]. A146540