Properties of the Number 27828

Twenty-Seven Thousand Eight Hundred Twenty-Eight

Basics

Value: 27827 → 27828 → 27829

Parity: even

Prime: No

Previous Prime: 27827

Next Prime: 27847

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 2 ² × 3 ² × 773

Divisors: 1, 2, 3, 4, 6, 9, 12, 18, 36, 773

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110110010110100

Octal: 66264

Duodecimal: 14130

Hexadecimal: 6cb4

Square: 774397584

Square Root: 166.81726529349413

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

Number of unordered rooted trees where each subtree from given node has the same number of nodes. A127524

T(n,k)=Number of nXk 0..1 arrays with rows in nondecreasing lexicographic order and columns in nonincreasing lexicographic order, but with exactly three mistakes. A278855

a(n) = T(n,n-6), array T as in A055801. A55806

a(n) = least positive k such that k, k+1, k+2, ..., k+n-1 is a stapled interval of length n, or 0 if no such sequence exists. A90318

Expansion of q^-1/3 * (η(q³) / η(q))⁴ in powers of q. A128758

Starting points of stapled intervals. A130173

"Stapled" intervals are defined in A090318. Call a stapled interval "maximal" if it is not a proper subinterval of any other stapled interval. Sequence gives starting points of maximal stapled intervals. A130170

Let J_n be n X n matrix which contains 1's only, I=I_n be the n X n identity matrix and P=P_n be the incidence matrix of the cycle (2,3,...,n,1). Then a(n) is the number of (0,1) n X n matrices A<=J_n-I-P with exactly two 1's in every row and column. A174564

Place n equally spaced points on each side of a square, and join each of these points by a chord to the 3·n new points on the other three sides: sequence gives number of edges in the resulting planar graph. A367279

Irregular triangle read by rows: T(n,k) is the sum of all parts of all partitions of n with k designated summands, n >= 1, 1 <= k <= A003056(n). A386997