Properties of the Number -52941

Fifty-Two Thousand Nine Hundred Forty-One

Basics

Value: -52942 → -52941 → -52940

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 3 × 7 × 2521

Divisors: 1, 3, 7, 21, 2521, 7563, 17647, 52941

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -1100111011001101

Octal: -147315

Duodecimal: -26779

Hexadecimal: -cecd

Square: 2802749481

Square Root: 230.08911317139714

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) arrays of permutations of 0..(n+1)*(k+1)-1 with each element having index change +-(.,.) 0,0 0,1 or 2,-2. A264090

Number T(n,k) of permutations of [n] having k cycles of the form (c1, c2, ..., c_m) where c1 = min_i>=1 c_i and c_j = min_i>=j c_i or c_j = max_i>=j c_i; triangle T(n,k), n>=0, 0<=k<=n, read by rows. A344855

Number of permutations of [n] having six cycles of the form (c1, c2, ..., c_m) where c1 = min_i>=1 c_i and c_j = min_i>=j c_i or c_j = max_i>=j c_i. A346321

Number of (n+1)X(6+1) arrays of permutations of 0..n·7+6 with each element having index change +-(.,.) 0,0 0,1 or 2,-2. A264088

Number of (2+1) X (n+1) arrays of permutations of 0..n·3+2 with each element having index change +-(.,.) 0,0 0,1 or 2,-2. A264091