Properties of the Number -5838

Eight Hundred Thirty-Eight

Basics

Value: -5839 → -5838 → -5837

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 2 × 3 × 7 × 139

Divisors: 1, 2, 3, 6, 7, 14, 21, 42, 139, 278

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -1011011001110

Octal: -13316

Duodecimal: -3466

Hexadecimal: -16ce

Square: 34082244

Square Root: 76.40680597957227

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) = 1 + ∑_k=2..n (-1)^k * k² * a(floor(n/k)). A361983

Triangle of coefficients of polynomials concerning Newman-like phenomenon of multiples of b+1 in even base b in interval [0,bⁿ) (see comment). A212822

Numbers k such that 3^k + 4 is prime. A58958

Values of the difference d for 5 primes in arithmetic progression with the minimal start sequence {5 + j·d}, j = 0 to 4. A206039

Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} having k increasing odd cycles (0<=k<=n). A cycle (b(1), b(2), ...) is said to be increasing if, when written with its smallest element in the first position, it satisfies b(1)<b(2)<b(3)<... . A cycle is said to be odd if it has an odd number of entries. For example, the permutation (152)(347)(6)(8) has 3 increasing odd cycles. A186761

Number of binary enriched p-trees of weight n. A300443

G.f. A(x,y) satisfies: x·y = ∑_n=-oo..+oo (-1)ⁿ * x^n*(n+1/2) * A(x,y)ⁿ, with coefficients T(n,k) of xⁿ*y^k in A(x,y) given as a triangle read by rows. A355350

Number of capturing set partitions of {1..n} that are not nesting. A326249

T(n,k)=Number of nXk 0..3 arrays x(i,j) with each element horizontally or vertically next to at least one element with value (x(i,j)+1) mod 4, and upper left element zero. A230250

T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 3, 4, 5, 6 or 7 king-move adjacent elements, with upper left element zero. A299321