Properties of the Number -18078

Eighteen Thousand Seventy-Eight

Basics

Value: -18079 → -18078 → -18077

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 2 × 3 × 23 × 131

Divisors: 1, 2, 3, 6, 23, 46, 69, 131, 138, 262

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -100011010011110

Octal: -43236

Duodecimal: -A566

Hexadecimal: -469e

Square: 326814084

Square Root: 134.45445325462447

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

This table shows the coefficients of combinatorial formulas needed for generating the sequential sums of p-th powers of triangular numbers. The p-th row (p>=1) contains a(i,p) for i=1 to 2·p-1, where a(i,p) satisfies ∑_i=1..n C(i+1,2)^p = 3·C(n+2,3) * ∑_i=1..2·p-1 a(i,p) * C(n-1,i-1)/(i+2). A87127

a(n) = a(n-1) + a(n-8), with a(i) = 1 for i = 0..7. A5710

Number T(n,k) of n-step walks on cubic lattice starting at (0,0,0), ending at (x,y,z) with x=k, remaining in the first (nonnegative) octant and using steps (0,0,1), (0,1,0), (1,0,0), (-1,1,1), (1,-1,1), and (1,1,-1); triangle T(n,k), n>=0, 0<=k<=n, read by rows. A328297

a(n) = prime(n)*(prime(n+1) + 1). A123134

Values at middle points of each row of A233270: a(n) = A233270(A233268(n)). A234018

Expansion of 1/(1 - x⁸ - x⁹ - ...). A17902

a(n) = ∑_{k=0..floor(3·n/8)} binomial(3·n-7·k,k). A392349

McKay-Thompson series of class 12d for Monster. A58492

McKay-Thompson series of class 24A for Monster. A58571

Number of n-step walks on cubic lattice starting at (0,0,0), ending at (0,y,z), remaining in the first (nonnegative) octant and using steps (0,0,1), (0,1,0), (1,0,0), (-1,1,1), (1,-1,1), and (1,1,-1). A328296