Properties of the Number -28143

Twenty-Eight Thousand One Hundred Forty-Three

Basics

Value: -28144 → -28143 → -28142

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 53 × 59

Divisors: 1, 3, 9, 53, 59, 159, 177, 477, 531, 3127

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -110110111101111

Octal: -66757

Duodecimal: -14353

Hexadecimal: -6def

Square: 792028449

Square Root: 167.75875536018978

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

Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} having k doubledescents (0 <= k <= n-2). We say that i is a doubledescent (also called a double fall) of a permutation p if p(i) > p(i+1) > p(i+2). A162975

For 1<=x<=n, 1<=y<=n, write gcd(x,y) = u·x+v·y with u,v minimal; a(n) = n⁴*s, where s is the population variance of the values of |u|. A345689

Sum of the squares of the quadratic residues of prime(n). A125613

Number of nonnegative solutions to (x₁)² + (x₂)² + ... + (x₇)² <= n. A341402

Numbers n such that (n+j) mod (2+j) = 1 for j from 0 to 5 and (n+6) mod 8 <> 1. A96024

Number of permutations of [n] having exactly three (possibly overlapping) doubledescents. A279292

Ratios of consecutive row products of triangle A094275. A94279

A109912(n+1)/A109912(n). A109913

a(n) = a(n-no-1)+....+a(n-1)+(n-no-2) where no is the 'no+1'th order of the series and 'n' is the element number, here no=6. A196876