Properties of the Number -662

Six Hundred Sixty-Two

Basics

Value: -663 → -662 → -661

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 14

Digital Root: 5

Palindrome: No

Factorization: 2 × 331

Divisors: 1, 2, 331, 662

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -1010010110

Octal: -1226

Duodecimal: -472

Hexadecimal: -296

Square: 438244

Square Root: 25.729360660537214

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 ∏_k>=1 1/(1 + x^k)^σ(k). A288421

Expansion of 1 / ∑_{k in Z} x^2·k / (1 - x^5·k+2). A375061

McKay-Thompson series of class 22B for Monster. A58568

Matrix inverse of triangle A096651; transforms n-dimensional partitions into (n-1)-dimensional partitions. A96874

McKay-Thompson series of class 22B for the Monster group with a(0) = -2. A132320

a(1) = 1, a(2n) = a(2n-1) + c(n) and a(2n+1) = a(2n) - p(n), where c(n)=A002808(n) and p(n)=A000040(n) are the n-th composite and n-th prime numbers, respectively. A73891

Expansion of 1 / (1 - x⁵ - x⁸ + x⁹) in powers of x. A257543

Number of compositions of n whose run-lengths are all equal. A329738

Number of integer partitions of n whose distinct parts are connected. A304716

Mian-Chowla sequence (a B₂ sequence): a(1) = 1; for n>1, a(n) = smallest number > a(n-1) such that the pairwise sums of elements are all distinct. A5282