Properties of the Number -6759

Seven Hundred Fifty-Nine

Basics

Value: -6760 → -6759 → -6758

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 751

Divisors: 1, 3, 9, 751, 2253, 6759

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: -1101001100111

Octal: -15147

Duodecimal: -3AB3

Hexadecimal: -1a67

Square: 45684081

Square Root: 82.21313763626833

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

T(n,k)=Number of nXk 0..1 arrays avoiding 0 0 0 and 0 1 1 horizontally and 0 0 1 and 0 1 0 vertically. A207242

T(n,k)=Number of nXk 0..1 arrays avoiding 0 0 0 and 1 0 1 horizontally and 0 0 1 and 0 1 0 vertically. A208164

Number of compositions (ordered partitions) of n into distinct parts >= 4. A339102

Number of connected circulant graphs on n nodes. A75545

a(n) = 10·n² - 1. A158447

Triangle read by rows: a(1,1) = 1. a(m,m) = sum of all terms in rows 1 through m-1. a(m,n) = a(m-1,n) + (sum of all terms in rows 1 through m-1), for n < m. A159927

Number of graphs with n nodes and n+1 edges. A48179

Number of strict compositions of n with alternating parts strictly decreasing. A342343

a(0) = 1; a(n) = 3·n * a(n-1) + ∑_k=0..n-1 binomial(n,k) * a(k). A343673

Number of connected vertex-transitive graphs with n nodes. A6800