Properties of the Number 5578

Five Thousand Five Hundred Seventy-Eight

Basics

Value: 5577 → 5578 → 5579

Parity: even

Prime: No

Previous Prime: 5573

Next Prime: 5581

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 2 × 2789

Divisors: 1, 2, 2789, 5578

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 1010111001010

Octal: 12712

Duodecimal: 328A

Hexadecimal: 15ca

Square: 31114084

Square Root: 74.68600939935136

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

Limiting reverse row of the array A274190. A274199

Number of unlabeled rooted trees with n vertices whose non-leaf terminal subtrees are all different. A324936

Octo numbers (a polygonal sequence): a(n) = 5·n² - 6·n + 2 = (n-1)² + (2·n-1)². A79273

T(n,k)=Number of nXk 0..3 arrays with no element equal to zero plus the sum of elements to its left or zero plus the sum of the elements above it or two plus the sum of the elements diagonally to its northwest, modulo 4. A240433

Number of inequivalent binary sequences of length n, where two sequences are said to be equivalent if they have the same set of phrases in their Ziv-Lempel encodings (the phrases can appear in a different order in the two sequences). A106182

Triangle read by rows: T(n,k) = ∑_{c in C(n,k)} lcm(c) where C(n,k) is the set of all k-subsets of {1,2,...,n}. A181853

G.f. satisfies A(x) = 1 + x·A(x * (1 + x²)). A360885

Number of partitions of n that do not contain 4 as a part. A27338

a(n) = least m such that if r and s in {1/1, 1/2, 1/3, ..., 1/n} satisfy r < s, then r < k/m < (k+4)/m < s for some integer k. A24846

Consider sequence of fractions A066657/A066658 produced by ratios of terms in A066720; let m = smallest integer such that all fractions 1/n, 2/n, ..., (n-1)/n have appeared when we reach A066720(m) = k; sequence gives values of m; set a(n) = -1 if some fraction i/n never appears. A66849