Properties of the Number -1769

Seven Hundred Sixty-Nine

Basics

Value: -1770 → -1769 → -1768

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 29 × 61

Divisors: 1, 29, 61, 1769

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: -11011101001

Octal: -3351

Duodecimal: -1035

Hexadecimal: -6e9

Square: 3129361

Square Root: 42.05948168962618

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

Square array A(n,k), n >= 0, k >= 0, read by antidiagonals, where column k is the expansion of e.g.f.: exp(∏_j=1..n (1-x^j) - 1). A294254

Row sums of number triangle related to the Jacobsthal numbers. A110325

Expansion of e.g.f. exp( 1 - 1/(1-2·x)^1/2 ). A380308

E.g.f.: exp((1-x)*(1-x²)*(1-x³) - 1). A294256

Coefficient triangle sequence of characteristic polynomials of a Fermat like matrix:M(n)=Eulerian n-th matrix: F(n)=M(n).Transpose[M(n)]]. A168242

Coefficients arising in an asymptotic expansion for the menage numbers. A260045

a(n) = n*(n+3)/2. A96

a(n) = n*(2·n + 3). A14106

Number of subsets of {1..n} containing the sum of every subset whose sum is <= n. A326080

Compound filter: a(n) = T(A000010(n), A046523(n)), where T(n,k) is sequence A000027 used as a pairing function. A286160