Properties of the Number 27112

Twenty-Seven Thousand One Hundred Twelve

Basics

Value: 27111 → 27112 → 27113

Parity: even

Prime: No

Previous Prime: 27109

Next Prime: 27127

Digit Sum: 13

Digital Root: 4

Palindrome: No

Factorization: 2 ³ × 3389

Divisors: 1, 2, 4, 8, 3389, 6778, 13556, 27112

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110100111101000

Octal: 64750

Duodecimal: 13834

Hexadecimal: 69e8

Square: 735060544

Square Root: 164.6572197020222

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

Squares where knight moving to a lowest unvisited square on a spirally numbered board will have no available moves. A323714

Number of n X 3 0..2 arrays with every row and column nondecreasing rightwards and downwards, and the number of instances of each value within one of each other. A201272

Number of length 4 1..(n+2) arrays with no leading or trailing partial sum equal to a prime. A254207

Number of nX4 0..1 arrays with every element equal to 1, 2, 4 or 7 king-move adjacent elements, with upper left element zero. A298089

G.f. satisfies: A(x) = ∑_n>=0 xⁿ / ∏_k=1..n (x + A(-x)^k). A221835

T(n,k)=Number of nXk 0..1 arrays with every element equal to 1, 2, 4 or 7 king-move adjacent elements, with upper left element zero. A298093

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