Properties of the Number -11648

Eleven Thousand Six Hundred Forty-Eight

Basics

Value: -11649 → -11648 → -11647

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 2 ⁷ × 7 × 13

Divisors: 1, 2, 4, 7, 8, 13, 14, 16, 26, 28

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -10110110000000

Octal: -26600

Duodecimal: -68A8

Hexadecimal: -2d80

Square: 135675904

Square Root: 107.92590050585633

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

Triangular table containing values of coefficients of the characteristic polynomial of a certain n·n circulant matrix, read by rows. A127412

a(n) = n³ * ∑_d∣n (-1)^{n/d + 1} * μ(d) / d³. A338548

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

G.f.: 4th root of weight enumerator of [16,11,4] extended Hamming code or Reed-Muller code RM(2,4). A110832

Expansion of e.g.f.: cos(arctan(x)*log(x+1))=1-12/4!*x⁴+60/5!*x⁵-90/6!*x⁶+420/7!*x⁷... A12400

A symmetrical triangle:t(n,m)=Binomial[PartitionsP[n] + m, m] + Binomial[PartitionsP[n] + n - m, n - m] - (Binomial[PartitionsP[n] + 0, 0] + Binomial[PartitionsP[ n] + n - 0, n - 0]) + 1. A176565

Jordan function J₃(n). A59376

Expansion of 1/((1-2·x)*(1-6·x)). A16129

a(n) = n * σ(A003961(n)), where A003961 shifts the prime factorization of n one step towards larger primes, and σ is the sum of the divisors of n. A341528

Number of partitions of n in which the greatest part is 9. A26815