Properties of the Number 27111

Twenty-Seven Thousand One Hundred Eleven

Basics

Value: 27110 → 27111 → 27112

Parity: odd

Prime: No

Previous Prime: 27109

Next Prime: 27127

Digit Sum: 12

Digital Root: 3

Palindrome: No

Factorization: 3 × 7 × 1291

Divisors: 1, 3, 7, 21, 1291, 3873, 9037, 27111

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110100111100111

Octal: 64747

Duodecimal: 13833

Hexadecimal: 69e7

Square: 735006321

Square Root: 164.65418306256296

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

Numbers k such that 3^k + 32 is prime. A219048

Sum of squares of first n positive integers congruent to 1 mod 3. A24215

Number of squares of all sizes in 3·n*(n+1)/2-ominoes in form of three-quarters of Aztec diamonds. A258440

Expansion of (1/x) * Series_Reversion( x / ( (1+x)³ * (1+2·x)³ ) ). A379522

a(n) = A168174(n)-10¹². A168248

Squares where A323809 gets stuck. A323813

a(n) is the smallest composite number obtained by appending one or more 1's to n. A358154

Squares visited by a knight on a spirally numbered board, moving always to the lowest available unvisited square, or one step back if no unvisited square is available. A323809

Digits (after the leading "0.") of "Type-2 Trott-like Constants" (see Comments lines for definition). A178160

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