Properties of the Number 27110

Twenty-Seven Thousand One Hundred Ten

Basics

Value: 27109 → 27110 → 27111

Parity: even

Prime: No

Previous Prime: 27109

Next Prime: 27127

Digit Sum: 11

Digital Root: 2

Palindrome: No

Factorization: 2 × 5 × 2711

Divisors: 1, 2, 5, 10, 2711, 5422, 13555, 27110

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110100111100110

Octal: 64746

Duodecimal: 13832

Hexadecimal: 69e6

Square: 734952100

Square Root: 164.65114636709944

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..1 arrays with every element unequal to 0, 1, 2, 4, 5 or 6 king-move adjacent elements, with upper left element zero. A305642

The sum of the weights of the stones-and-bones tilings of the (n,2n-3)-benzel, where each stone is given multiplicative weight 3. A364438

Number of (0,1)-strings of length n that avoid the substrings of substrings 11101011 and 101111. A62259

Number of permutations p of [n] such that |p(i) - p(i-1)| is in {2,7} for all i from 2 to n. A328648

Expansion of (1/x) * Series_Reversion( x * (1 - x) / (1 + x³ / (1 - x)³) ). A389411

Number of ways to place 8 nonattacking amazons (superqueens) on an 8 X n board. A178372

Number of nX4 0..1 arrays with every element unequal to 0, 1, 2, 4, 5 or 6 king-move adjacent elements, with upper left element zero. A305638

Number of nX7 0..1 arrays with every element unequal to 0, 1, 2, 4, 5 or 6 king-move adjacent elements, with upper left element zero. A305641

Triangle read by rows: T(n,k) is the number of sequences in which the games of a single-elimination tournament with n teams can be played if arbitrarily many arenas are available, the tournament bracket is chosen to the bracket with the largest such number of sequences, and the number of distinct times at which games are played is k, log₂(n) <= k <= n-1. A378855

a(n) = ∑_k=0..2n-1 T(n,k) * T(n,k+1), with T given by A027082. A27110