Properties of the Number -5043

Forty-Three

Basics

Value: -5044 → -5043 → -5042

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 12

Digital Root: 3

Palindrome: No

Factorization: 3 × 41 ²

Divisors: 1, 3, 41, 123, 1681, 5043

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -1001110110011

Octal: -11663

Duodecimal: -2B03

Hexadecimal: -13b3

Square: 25431849

Square Root: 71.01408311032397

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

a(n+3) = 2a(n+2) - 3a(n+1) + 2a(n); a(0) = 1, a(1) = 3, a(2) = 4. A105579

Expansion of ∑_k>=1 x^k/(1 + k·x^k). A308367

a(n) = ceiling( 4ⁿ/20 - (n² + 1)*2^n-1 ). A188162

Values of n such that L(15) and N(15) are both prime, where L(k) = (n²+n+1)*2^2·k + (2·n+1)*2^k + 1, N(k) = (n²+n+1)*2^k + n. A227518

First differences of number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 133", based on the 5-celled von Neumann neighborhood. A270235

a(n) = 3·n². A33428

Numbers m such that there are precisely 3 groups of order m. A55561

Number A(n,k) of partitions of n^k into parts that are at most n; square array A(n,k), n>=0, k>=0, read by antidiagonals. A238016

Number of ways to split a strict integer partition of n into consecutive subsequences with weakly decreasing sums. A319794

Number of coupled non-normal semi-magic rectangles with sum of entries equal to n. A321718