Properties of the Number -16988

Sixteen Thousand Nine Hundred Eighty-Eight

Basics

Value: -16989 → -16988 → -16987

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 32

Digital Root: 5

Palindrome: No

Factorization: 2 ² × 31 × 137

Divisors: 1, 2, 4, 31, 62, 124, 137, 274, 548, 4247

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -100001001011100

Octal: -41134

Duodecimal: -99B8

Hexadecimal: -425c

Square: 288592144

Square Root: 130.33802208104893

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

a(n) = |{m : multiplicative order of 7 mod m=n}|. A59889

One of the two successive approximations up to 3ⁿ for the 3-adic integer sqrt(-2). These are the numbers congruent to 2 mod 3 (except for the initial 0). A271222

Numbers n such that φ(n) = φ(n+7), with Euler's totient function φ = A000010. A179189

Number of multisets of nonempty words with a total of n letters over binary alphabet such that within each prefix of a word every letter of the alphabet is at least as frequent as the subsequent alphabet letter. A293732

Expansion of g.f. ∏_k>=1 1/(1-x^σ(k)). A111865

Generating function: 1/((1-x)*(1-x²)²*(1-x³)³*(1-x⁴)⁴). A64349

Records in A139251. A152768

A generalized partition function. A2598

Trisection of A007294. A73470

Number of 3 X n 0..2 arrays with horizontal differences mod 3 never 1, vertical differences mod 3 never -1, and rows and columns lexicographically nondecreasing. A229446