Properties of the Number 27160

Twenty-Seven Thousand One Hundred Sixty

Basics

Value: 27159 → 27160 → 27161

Parity: even

Prime: No

Previous Prime: 27143

Next Prime: 27179

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 2 ³ × 5 × 7 × 97

Divisors: 1, 2, 4, 5, 7, 8, 10, 14, 20, 28

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110101000011000

Octal: 65030

Duodecimal: 13874

Hexadecimal: 6a18

Square: 737665600

Square Root: 164.8029125956213

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 -k..k arrays x(0..n-1) of n elements with nonzero sum and with zero through n-1 differences all nonzero. A200165

Triangle read by rows: T(n,k) is the number of simple graphs on n unlabeled nodes with upper domination number k. A332403

Indices of prime values of heptanacci-Lucas numbers A104621. A104622

Triangle read by rows: T(n,k) is the number of simple graphs on n unlabeled nodes with upper irredundance number k. A332405

Triangle of coefficients of polynomials v(n,x) jointly generated with A209170; see the Formula section. A209171

G.f.: ∑_n>=0 (n+1)*(n+2)*(n+3)/3! * xⁿ * (1 + xⁿ)ⁿ. A326004

Partition the j digits of n into blocks of k, with 1 <= k <= j-1, starting at right and multiply. Sum of these numbers equals n. A275170

Number of -n..n arrays x(0..3) of 4 elements with nonzero sum and with zero through 3 differences all nonzero. A200167

Number of 0..n arrays x(0..7) of 8 elements with zero 4th differences. A200331

Triangle read by rows. Row k are the coefficients of the polynomials (sorted by ascending powers) which interpolate the points (n, A355257(n, k+1)) for n = 0..k. A355259