Properties of the Number 27782

Twenty-Seven Thousand Seven Hundred Eighty-Two

Basics

Value: 27781 → 27782 → 27783

Parity: even

Prime: No

Previous Prime: 27779

Next Prime: 27791

Digit Sum: 26

Digital Root: 8

Palindrome: No

Factorization: 2 × 29 × 479

Divisors: 1, 2, 29, 58, 479, 958, 13891, 27782

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110110010000110

Octal: 66206

Duodecimal: 140B2

Hexadecimal: 6c86

Square: 771839524

Square Root: 166.67933285203657

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..7 arrays with every row and column nondecreasing rightwards and downwards, and the number of instances of each value within one of each other. A201101

G.f.: ∑_k>=1 x^k/(1-x^k) * ∏_k>=1 (1+x^k)/(1-x^k). A305102

T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with rows and columns nondecreasing. A265005

Row sums of a Pascal-Fibonacci triangle. A114199

Number of nX3 0..7 arrays with every row and column nondecreasing rightwards and downwards, and the number of instances of each value within one of each other. A201096

a(n) = 3·n³ - 1. A345701

Number of nX3 arrays containing 3 copies of 0..n-1 with rows and columns nondecreasing. A265000

a(n) = 9*(n+1)*binomial(n+2,9)/2. A27782