Properties of the Number 77320

Seventy-Seven Thousand Three Hundred Twenty

Basics

Value: 77319 → 77320 → 77321

Parity: even

Prime: No

Previous Prime: 77317

Next Prime: 77323

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 2 ³ × 5 × 1933

Divisors: 1, 2, 4, 5, 8, 10, 20, 40, 1933, 3866

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 10010111000001000

Octal: 227010

Duodecimal: 388B4

Hexadecimal: 12e08

Square: 5978382400

Square Root: 278.0647406630334

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

Solution of the complementary equation a(n) = 2·a(n-1) - b(n-1), where a(0) = 3, a(1) = 5, b(0) = 1, and (a(n)) and (b(n)) are increasing complementary sequences. A295058

Number of 6Xn binary arrays with rows and columns lexicographically nondecreasing and column sums nonincreasing. A266473

Number of n X 7 binary arrays with rows and columns lexicographically nondecreasing and column sums nonincreasing. A266469

T(n,k) = number of n X k binary arrays with rows and columns lexicographically nondecreasing and column sums nonincreasing. A266470

Triangle in which n-th row contains n smallest multiples of the n-th prime. A77320

The hyper-Wiener index of the tree g[n] (n>=0) defined recursively in the following manner: denoting by P[n] the path on n vertices, we define g[0] =P[2] while g[n] (n>=1) is the tree obtained by identifying the roots of 2 copies of g[n-1] and one of the end-vertices of P[n+1]; the root of g[n] is defined to be the other end-vertex of P[n+1]. A227714