Properties of the Number 43387

Forty-Three Thousand Three Hundred Eighty-Seven

Basics

Value: 43386 → 43387 → 43388

Parity: odd

Prime: No

Previous Prime: 43331

Next Prime: 43391

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 43 × 1009

Divisors: 1, 43, 1009, 43387

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1010100101111011

Octal: 124573

Duodecimal: 21137

Hexadecimal: a97b

Square: 1882431769

Square Root: 208.29546322471836

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

Ménage numbers: a(0) = 1, a(1) = -1, and for n >= 2, a(n) = number of permutations s of [0, ..., n-1] such that s(i) ≠ i and s(i) ≠ i+1 (mod n) for all i. A179

Triangle read by rows: T(n,k) = number of permutations of [n] allowing i->i+j (mod n), j=0..k-1. A8305

Triangle read by rows, giving coefficients of the ménage hit polynomials ordered by descending powers. T(n, k) for 0 <= k <= n. A58087

Same as A000179, except that a(0) = 2. A102761

A variant of A000179 and A102761. A335700

Triangle read by rows of generalized ménage numbers: T(n,k) is the number of permutations π in S_n such that π(i) ≠ i and π(i) ≠ i+k (mod n) for all i; n, 1 <= k < n. A354408

Triangle read by rows: T(n,k) = number of ways of seating n couples around a circular table so that exactly k married couples are adjacent (0 <= k <= n). A94314

Triangle T(n,k) giving the number of permutations π of {1,2,...,n} such that for all i, π(i) is not in {i, i+1, ..., i+k-1} (mod n), with 0 <= k <= n - 1. A321352

Square array read by antidiagonals downwards: for n >= 2, T(k,n) is the number of permutations of [k+n] that differ in every position from both the identity permutation and a permutation consisting of k 1-cycles and one n-cycle. A335391

Table of generalized ménage numbers read by antidiagonals upward: T(n,k) is the number of permutations π in S_k such that π(i) ≠ i, i+n (mod k) for all i; n, k >= 1. A341439