Properties of the Number 27731

Twenty-Seven Thousand Seven Hundred Thirty-One

Basics

Value: 27730 → 27731 → 27732

Parity: odd

Prime: No

Previous Prime: 27701

Next Prime: 27733

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 11 × 2521

Divisors: 1, 11, 2521, 27731

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110110001010011

Octal: 66123

Duodecimal: 1406B

Hexadecimal: 6c53

Square: 769008361

Square Root: 166.52627420320195

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 (n+1)X(k+1) 0..1 arrays with the sum of each 2X2 subblock two extreme terms minus its two median terms lexicographically nondecreasing rowwise and columnwise. A235555

a(n) = minimal m such that m>n, n divides m, n-1 divides m-1, n-2 divides m-2 and so on down to 1 divides m-n+1. A60401

Expansion of (1/x) * Series_Reversion( x * (1 - x² / (1 - x)⁵) ). A389347

Expansion of g.f. 1/((1-7·x)*(1-10·x)). A16181

Column 2 of triangle A130580. A130582

Number of distinct functions from a set with nⁿ elements to itself that can be defined naturally (in n) by typed λ-calculus expressions. A65500

Records in A352187. A352191

Number of (n+1)X(2+1) 0..1 arrays with the sum of each 2X2 subblock two extreme terms minus its two median terms lexicographically nondecreasing rowwise and columnwise. A235550

Number of (n+1)X(6+1) 0..1 arrays with the sum of each 2X2 subblock two extreme terms minus its two median terms lexicographically nondecreasing rowwise and columnwise. A235554

a(n) is the sum of the terms of the symmetric square array defined by M(i,j) = prime(i)+i-j for i >= j and M(i,j) = M(j,i) if i < j. A308731