Properties of the Number -43680

Forty-Three Thousand Six Hundred Eighty

Basics

Value: -43681 → -43680 → -43679

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 2 ⁵ × 3 × 5 × 7 × 13

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

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: Yes

Today's Target

4938 Try Today's Challenge

Representations

Binary: -1010101010100000

Octal: -125240

Duodecimal: -21340

Hexadecimal: -aaa0

Square: 1907942400

Square Root: 208.9976076418101

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

Coefficients for rewriting generalized falling factorials into ordinary falling factorials. A136656

Consider the e.g.f. C(x,y) = ∑_n>=0 ∑_k=0..n T(n,k) * x^2·n-2·k+1 * y^2·k+1 / (2·n+2)! and related functions A(x,y) and B(x,y), as defined in the Formula section. Sequence gives the triangular array of coefficients T(n,k) (n>=0, 0<=k<=n) of C(x,y). A326799

E.g.f. A(x) satisfies: ∑_n>=0 1/n! * ∏_k=0..n (n+1-k)*x + (k+1)*A(x) = 0. A306066

Cusp form of weight 13/2 associated to the unique cusp form of weight 12 under Shimura correspondence. A54891

Coefficient list of ChebyshevU(n, 1-x). A100551

a(n) = 1² + 3² + 5² + 7² + ... + (2·n-1)² = n*(4·n² - 1)/3. A447

Products of 4 consecutive integers: a(n) = n*(n-1)*(n-2)*(n-3). A52762

Ruth-Aaron numbers (1): sum of prime divisors of n = sum of prime divisors of n+1. A6145

Infinite lower triangular matrix, M, that satisfies [M²](i,j) = M(i+1,j+1) for all i,j>=0 where [Mⁿ](i,j) denotes the element at row i, column j, of the n-th power of matrix M, with M(0,k)=1 and M(k,k)=1 for all k>=0. A78121

Smallest k such that σ(x) = k has exactly n solutions. A7368