Properties of the Number -5242

Two Hundred Forty-Two

Basics

Value: -5243 → -5242 → -5241

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 13

Digital Root: 4

Palindrome: No

Factorization: 2 × 2621

Divisors: 1, 2, 2621, 5242

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -1010001111010

Octal: -12172

Duodecimal: -304A

Hexadecimal: -147a

Square: 27478564

Square Root: 72.40165743959182

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

Expansion of ∏_j>=1 (1 - x^j)/(1 - x^3·j)³. A286952

Hertzsprung's problem: ways to arrange n non-attacking kings on an n X n board, with 1 in each row and column. Also number of permutations of length n without rising or falling successions. A2464

Numbers k giving rise to prime quadruples (30k+11, 30k+13, 30k+17, 30k+19). A14561

Write 1/e as a binary fraction; read this from left to right and whenever a 1 appears, note the integer formed by reading leftwards from that 1. A99969

Triangle read by rows: T(n,k) = number of permutations of length n with exactly k rising or falling successions, for n >= 1, 0 <= k <= n-1. A1100

Number T(n,k) of permutations p of [n] such that |p(i+k) - p(i)| <> k for i in [n-k]; triangle T(n,k), n>=0, 0<=k<=n, read by rows. A333706

Number of integer partitions of n with fewer parts than distinct divisors of parts. A371173

Number of distinct products ijk with 1 <= i,j,k <= n. A27425

Numbers k such that 5^k + 4 is prime. A124621

Number of integer partitions of n with no adjacent parts of quotient 2. A350837