Properties of the Number -38760

Thirty-Eight Thousand Seven Hundred Sixty

Basics

Value: -38761 → -38760 → -38759

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 2 ³ × 3 × 5 × 17 × 19

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

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -1001011101101000

Octal: -113550

Duodecimal: -1A520

Hexadecimal: -9768

Square: 1502337600

Square Root: 196.8755952371954

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-4·x)^5/2. A2422

Seventh convolution of A115140. A115146

First term of n-th difference sequence of (floor(π*k)), k >= 0. A325739

Expansion of (1-4·x)^21/2. A20933

a(n) = ∑_k=0..n (-1)^n-k*binomial(n, k)²*hypergeom([(k-n)/2, (k-n+1)/2], [k+2], 4). A344503

Expansion of -x*(2·x - 1)*(2·x² - 1)*(x³ + 2·x² - x - 1)/((x - 1)*(x² + x - 1)*(x⁴ - 4·x³ - 4·x² + x + 1)). A122605

Figurate numbers or binomial coefficients C(n,6). A579

a(n) = lcm{1,2,...,n} / swinging_factorial(n) = A003418(n) / A056040(n). A180000

a(n) = binomial(3n-1, n-1). A25174

Triangle read by rows: T(n, k) = binomial(2n, 2k). A86645