Properties of the Number 12160

Twelve Thousand One Hundred Sixty

Basics

Value: 12159 → 12160 → 12161

Parity: even

Prime: No

Previous Prime: 12157

Next Prime: 12161

Digit Sum: 10

Digital Root: 1

Palindrome: No

Factorization: 2 ⁷ × 5 × 19

Divisors: 1, 2, 4, 5, 8, 10, 16, 19, 20, 32

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 10111110000000

Octal: 27600

Duodecimal: 7054

Hexadecimal: 2f80

Square: 147865600

Square Root: 110.27239001672177

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

E.g.f.: (1/(1-x⁴))*exp( 4*∑_i>=0 x^4·i+1/(4·i+1) ) for an order-4 linear recurrence with varying coefficients. A97679

4-dimensional analog of centered polygonal numbers: a(n) = n(n+1)*(n²+n+4)/12. A6007

Even octagonal numbers: a(n) = 4·n*(3·n-1). A14642

Triangle T(n,m) read by rows: let p(n,x) = exp(-x) * ∑_{m >= 0} (2·m + 1)ⁿ * x^m/m!; then T(n,m) = [x^m] p(n,x). A154537

Numbers n such that m + (sum of digits in base-3 representation of m) = n has exactly four solutions. A230856

Numbers with prime signature {7,1,1}, i.e., of form p⁷*q·r with p, q and r distinct primes. A179696

T(n,k)=Number of nXk 0..1 arrays with no 1 equal to more than one of its horizontal, vertical and antidiagonal neighbors, with the exception of exactly two elements. A282969

Numbers k such that there are exactly 5 numbers j for which binomial(k, floor(k/2)) / binomial(k,j) is an integer, i.e., A080383(k) = 5. A327430

Triangle of coefficients of polynomials defined by Binet form: P(n,x) = ((x+d)ⁿ + (x-d)ⁿ)/2, where d=sqrt(x+4). A162516

Triangle read by rows: T(n,k) = number of parity alternating partitions of [n] into k blocks (1 <= k <= m). A274310