Properties of the Number -14512

Fourteen Thousand Five Hundred Twelve

Basics

Value: -14513 → -14512 → -14511

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 13

Digital Root: 4

Palindrome: No

Factorization: 2 ⁴ × 907

Divisors: 1, 2, 4, 8, 16, 907, 1814, 3628, 7256, 14512

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -11100010110000

Octal: -34260

Duodecimal: -8494

Hexadecimal: -38b0

Square: 210598144

Square Root: 120.46576277100478

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

Expansion of 1/(1 + x + x/(1 + x² + x²/(1 + x³ + x³/(1 + x⁴ + x⁴/(1 + ...))))), a continued fraction. A292854

Number of ways to place non-intersecting diagonals in convex n-gon so as to create no triangles. A46736

Number of connected partially ordered sets with n unlabeled elements. A608

Expansion of e.g.f.: (1-x)/(2-exp(x)). A53525

Triangle read by rows: T(n,k) (n>=1, k>=1) is the number of posets with n elements whose Hasse diagram has k connected components. A263864

a(n) is the number of time-dependent assembly trees satisfying the connected gluing rule for a cycle on n vertices. A317057

Constant term of the reduction by x²->x+1 of the polynomial p(n,x) defined below in Comments. A192754

Number of partitions of n in which the largest summand has frequency 1, the next largest summand has frequency at most 2, the third largest has frequency at most 3, etc. A244395

Triangle read by rows: T(n,k) (0<=k<=n) is the number of Delannoy paths of length n, having k (1,1)-steps on the line y=x (a Delannoy path of length n is a path from (0,0) to (n,n), consisting of steps (E=1,0), N=(0,1) and D(1,1)). A109979

a(n) = ∑_k=1..n (-1)^n-k * Stirling1(n,k) * floor(n/k). A309910