Properties of the Number -100776

One Hundred Thousand Seven Hundred Seventy-Six

Basics

Value: -100777 → -100776 → -100775

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 21

Digital Root: 3

Palindrome: No

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

Divisors: 1, 2, 3, 4, 6, 8, 12, 13, 17, 19

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -11000100110101000

Octal: -304650

Duodecimal: -4A3A0

Hexadecimal: -189a8

Square: 10155802176

Square Root: 317.4523586303935

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

G.f.: A(x,y) = ∑_n=-oo..+oo (x·y)^n*(n+1/2) * C(x)^2·n-1, where C(x) = 1 + x·C(x)² is the g.f. of the Catalan numbers (A000108). A355346

a(n) = 2·Catalan(n) - Catalan(n-1). A782

Dimensions of the irreducible representations of the simple Lie algebra of type F4 over the complex numbers, listed in increasing order. A121738

a(n) = (n+1)*(2·n+1)*(3·n+1). A11199

Number of internal triangles in all triangulations of an (n+1)-gon. A2058

Triangle T(n,k) read by rows: coefficients of polynomials P_n(t) defined in Formula section. A286785

a(n) = σ(n)*Fibonacci(n), where σ(n) = A000203(n), the sum of divisors of n. A203848

If n | a(n) then a(n+1) = a(n)/(highest power of n that divides a(n)), otherwise a(n+1) = n·a(n); a(0) = 1. A65422

Smallest integer value of lcm(n+1, n+2, ..., n+k) (for k >= 0) divided by the product of all the primes up to n. A75368

Successive maxima in sequence A007365. A65933