Properties of the Number -14040

Fourteen Thousand Forty

Basics

Value: -14041 → -14040 → -14039

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 9

Digital Root: 9

Palindrome: No

Factorization: 2 ³ × 3 ³ × 5 × 13

Divisors: 1, 2, 3, 4, 5, 6, 8, 9, 10, 12

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -11011011011000

Octal: -33330

Duodecimal: -8160

Hexadecimal: -36d8

Square: 197121600

Square Root: 118.490505948789

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 a Schwarzian ({f_27∣3, τ} / (4*π)²) in powers of q³. A62248

Expansion of a(q) * b(q)² in powers of q where a(), b() are cubic AGM θ functions. A181976

Number of partitions of n such that the number of parts is divisible by the greatest part. Also number of partitions of n such that the greatest part is divisible by the number of parts. A168659

Decagorials: n-th polygorial for k=10. A84943

T(n,k)=Number of length n+5 0..k arrays with every six consecutive terms having the maximum of some three terms equal to the minimum of the remaining three terms. A250336

T(n,k)=Number of nXk 0..1 arrays with no more than floor(nXk/2) elements unequal to at least one horizontal or antidiagonal neighbor, with new values introduced in row major 0..1 order. A223012

T(n,k)=Number of length n+2 0..k arrays with no three consecutive terms having the sum of any two elements equal to twice the third. A248461

Generalized Stirling2 array (5,2). A91534

Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} having k increasing odd cycles (0<=k<=n). A cycle (b(1), b(2), ...) is said to be increasing if, when written with its smallest element in the first position, it satisfies b(1)<b(2)<b(3)<... . A cycle is said to be odd if it has an odd number of entries. For example, the permutation (152)(347)(6)(8) has 3 increasing odd cycles. A186761

T(n,k)=Number of n-step one space for components leftwards or up, two space for components rightwards or down asymmetric quasi-queen's tours (antidiagonal moves become knight moves) on a kXk board summed over all starting positions. A187857