Properties of the Number 7768

Seven Thousand Seven Hundred Sixty-Eight

Basics

Value: 7767 → 7768 → 7769

Parity: even

Prime: No

Previous Prime: 7759

Next Prime: 7789

Digit Sum: 28

Digital Root: 1

Palindrome: No

Factorization: 2 ³ × 971

Divisors: 1, 2, 4, 8, 971, 1942, 3884, 7768

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 1111001011000

Octal: 17130

Duodecimal: 45B4

Hexadecimal: 1e58

Square: 60341824

Square Root: 88.13625814612281

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

Symmetric triangle, read by rows, where row n equals the (n+1)-th differences of the crystal ball sequence for D_n lattice, for n>=0. A108558

Dirichlet g.f.: ∏_k>=2 1 / (1 - k^-s)⁸. A339323

Convolution of A000010 with itself. A65093

Number of meaningful differential operations of the k-th order on the space R¹¹. A129638

Number of n X 3 1..2 arrays containing at least one of each value, all equal values connected, rows considered as a single number in nondecreasing order, and columns considered as a single number in nonincreasing order. A166830

Number of ways of getting 5 of a kind, a royal flush, other straight flush, 4 of a kind, full house, other flush, other straight, 3 of a kind, 2 pair, a pair or no pair in 5-card poker when joker is wild. A14357

Number of zig-zag paths from top to bottom of an n X n square whose color is that of the top right corner. A153334

Number of zig-zag paths from top to bottom of an n X n square whose color is not that of the top right corner. A153335

Number of zig-zag paths from top to bottom of a 2n by 2n square whose color is that of the top right corner. A153336

Start from the singleton set S = {n}, and unless 1 is already a member of S, generate on each iteration a new set where each odd number k is replaced by 3k+1, and each even number k is replaced by 3k+1 and k/2. a(n) is the size of the set after the first iteration which has produced 1 as a member. A290100