Properties of the Number 27203

Twenty-Seven Thousand Two Hundred Three

Basics

Value: 27202 → 27203 → 27204

Parity: odd

Prime: No

Previous Prime: 27197

Next Prime: 27211

Digit Sum: 14

Digital Root: 5

Palindrome: No

Factorization: 11 × 2473

Divisors: 1, 11, 2473, 27203

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110101001000011

Octal: 65103

Duodecimal: 138AB

Hexadecimal: 6a43

Square: 740003209

Square Root: 164.9333198598755

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

Number of ways to split an integer partition of n into consecutive subsequences with weakly decreasing sums. A316245

a(n) = ∑_k=0..n C(n,k)*S2(n,k). Binomial convolution of the Stirling numbers of the 2nd kind. Also sum of the rows of A122454. A122455

Triangle, read by rows, where T(n,k) = [(I + D·C)ⁿ](n,k); that is, row n of T = row n of (I + D·C)ⁿ for n>=0 where C denotes Pascal's triangle, I the identity matrix and D a matrix where D(n+1,n)=1 and zeros elsewhere. A134090

Principal diagonal of the convolution array A213836. A213837

a(n) = 225·n² - 2·n. A158226

Poincaré series [or Poincare series] for depths of roots in a certain root system. A19527

Number of 2X3 integer matrices with each row summing to zero, row elements in nondecreasing order, rows in lexicographically nondecreasing order, and the sum of squares of the elements <= 2·n² (number of collections of 2 zero-sum 3-vectors with total modulus squared not more than 2·n², ignoring vector and component permutations). A192698

Triangle read by rows, T(n,k) = ∑_j=0..n (-1)^n-j*C(-j-1,-n-1)*S2(k,j), S2 the Stirling set numbers A048993, for n>=0 and 0<=k<=n. A271702

a(n) is the largest number that can be expressed as the sum of three positive triangular numbers in exactly n ways. A330811

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