Properties of the Number -2097

Ninety-Seven

Basics

Value: -2098 → -2097 → -2096

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 233

Divisors: 1, 3, 9, 233, 699, 2097

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: -100000110001

Octal: -4061

Duodecimal: -1269

Hexadecimal: -831

Square: 4397409

Square Root: 45.79301256742124

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 r(q³) / r(q)³ in powers of q where r() is the Rogers-Ramanujan continued fraction. A285583

Odd numbers of the form p^1+4k * r², where p is prime of the form 1+4m, r > 1, and gcd(p,r) = 1. (Euler's criteria for odd perfect numbers). A228058

Numbers n such that the decimal expansions of both n and n² have 0 as smallest digit and 9 as largest digit. A256709

Number of integer partitions of n having a permutation with all equal run-lengths. A383013

Number of integer partitions of n whose sum of primes of parts is divisible by n. A331379

Irregular triangle T(n,k) read by rows: T(n,k) is the number of compositions of n with k descents, n>=0, 0<=k<=floor(n/3). A238344

T(n,k)=Number of nXk 0..1 arrays with every 1 horizontally, diagonally or antidiagonally adjacent to 1 or 2 neighboring 1s. A297506

Apart from initial term, composite numbers with the property that the concatenation of their prime factors is a palindrome. A46447

T(n,k)=Number of nXk arrays of the minimum value of corresponding elements and their horizontal, vertical, diagonal or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..2 nXk array. A219915

a(n) = ∑_k=1..n floor(n/k)*2^k-1. A268235