Properties of the Number -7568

Five Hundred Sixty-Eight

Basics

Value: -7569 → -7568 → -7567

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 26

Digital Root: 8

Palindrome: No

Factorization: 2 ⁴ × 11 × 43

Divisors: 1, 2, 4, 8, 11, 16, 22, 43, 44, 86

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -1110110010000

Octal: -16620

Duodecimal: -4468

Hexadecimal: -1d90

Square: 57274624

Square Root: 86.99425268372619

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

G.f.: exp( ∑_n>=1 A002129(n²)*xⁿ/n ), where A002129(n) is the excess of sum of odd divisors of n over sum of even divisors of n. A225925

Low temperature series for spin-1/2 Ising partition function on body-centered cubic lattice. A371049

a(n) = ∑_{i=1..n, j=1..n, gcd(i,j)=1} (n+1-i)*(n+1-j). A115004

8 times triangular numbers: a(n) = 4·n*(n+1). A33996

Centered heptagonal numbers. A69099

Number of sets (in the Hausdorff metric geometry) at each location between two sets defined by a complete bipartite graph K(4,n) (with n at least 3) missing two edges, where the removed edges are incident to the same vertex in the four point part. A335613

Number of sets in the geometry determined by the Hausdorff metric at each location between two sets defined by a complete bipartite graph K(4,n) (with n at least 3) missing two edges, where the two removed edges are not incident to the same vertex in the 4-point set but are incident to the same vertex in the other set. A340173

Convolution of primes with themselves. A14342

T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every element next to itself plus and minus one within the range 0..2 horizontally or antidiagonally, with no adjacent elements equal. A232589

Number of (directed) Hamiltonian paths in the n-ladder graph. A137882