Properties of the Number 27488

Twenty-Seven Thousand Four Hundred Eighty-Eight

Basics

Value: 27487 → 27488 → 27489

Parity: even

Prime: No

Previous Prime: 27487

Next Prime: 27509

Digit Sum: 29

Digital Root: 2

Palindrome: No

Factorization: 2 ⁵ × 859

Divisors: 1, 2, 4, 8, 16, 32, 859, 1718, 3436, 6872

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 110101101100000

Octal: 65540

Duodecimal: 13AA8

Hexadecimal: 6b60

Square: 755590144

Square Root: 165.79505420850165

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

T(n,k)=Number of nXk 0..2 arrays with no element equal to more than one of its horizontal and antidiagonal neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards. A281326

Number of n X 1 0..2 arrays with no element equal to more than one of its horizontal and vertical neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards. A280279

Number of largest subsets of the set of points in an n X n square grid, such that no two points are at the same distance. A335232

Triangle T(n,k) is the number of restricted growth strings (RGS) of set partitions of {1..n} that have a decrease at index k (1<=k<n). A56862

Convolution triangle by rows, A004736 * (A154108·0^n-k); row sums = Bell numbers. A154109

Irregular triangle read by rows. Properly color the vertices of a simple labeled graph on [n] using exactly n colors c₁<c₂<...<c_n (in other words, use each color exactly once). Orient the edges according to the strict order on the colors. T(n,k) is the number of such graphs with exactly k descents, n>=0, 0<=k<=binomial(n,2). A381192

Triangle read by rows, related to A055129 (repunits in base k). A107893

Number of n X 2 0..2 arrays with no element equal to more than one of its horizontal and antidiagonal neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards. A281320

Third column of triangle A027477, constructed from the Stirling numbers of the first kind. A27488

Numbers that can be expressed as the sum of the first j integer numbers or the first k nonprime numbers, with j and k >=1. A154588