Properties of the Number 27055

Twenty-Seven Thousand Fifty-Five

Basics

Value: 27054 → 27055 → 27056

Parity: odd

Prime: No

Previous Prime: 27043

Next Prime: 27059

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 5 × 7 × 773

Divisors: 1, 5, 7, 35, 773, 3865, 5411, 27055

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110100110101111

Octal: 64657

Duodecimal: 137A7

Hexadecimal: 69af

Square: 731973025

Square Root: 164.48404177913432

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

a(n) is the smallest number which can be represented as the sum of n distinct nonzero n-gonal numbers in exactly n ways, or 0 if no such number exists. A350405

Number of permutations of length n which avoid the patterns 123 and 4312. A116699

Expansion of 1/((1-x)(1-3x)(1-6x)(1-9x)). A21504

Number of binary arrays indicating the locations of trailing edge maxima of a random length-n 0..4 array extended with zeros and convolved with -1,2,-1. A222039

Number of nX3 0..1 arrays with every element equal to 0, 1, 3 or 5 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero. A302422

Start with the list of positive integers 1,2,3,... . After each integer k, insert k empty positions. Fill these positions, from left to right, with the positive integers in order. Repeat this spacing-and-filling process indefinitely. The sequence consists of the positions of the last occurrence of 1 after each step. A391868

Sum of Gaussian binomial coefficients [ n,k ] for q=3. A6117

a(n) = T(n, n+4), T given by A027052. A27055