Properties of the Number -8143

One Hundred Forty-Three

Basics

Value: -8144 → -8143 → -8142

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 17 × 479

Divisors: 1, 17, 479, 8143

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -1111111001111

Octal: -17717

Duodecimal: -4867

Hexadecimal: -1fcf

Square: 66308449

Square Root: 90.2385726837476

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) = 2²ⁿ⁺¹*cos(nA), where A is the angle opposite side BC in a triangle ABC having sidelengths |BC|=2, |CA| = 3, |AB| = 4; ABC is the smallest integer-sided scalene triangle. A375880

a(n) = n - 2^{sum of digits of n}. A328882

a(n) = 2ⁿ⁺¹*cos(n·arctan(sqrt(15))). A272931

a(n) = 2³ⁿ⁺¹*cos(nB), where B is the angle opposite side CA in a triangle ABC having sidelengths |BC|=2, |CA| = 3, |AB| = 4; ABC is the smallest integer-sided scalene triangle. A375881

a(n) = 15·n² + 9·n + 1. A134153

a(n) = a(n-1) + a(m) for n >= 4, where m = 2^p+1 + 2 - n and p is the unique integer such that 2^p < n - 1 <= 2^p+1, starting with a(1) = 1 and a(2) = a(3) = 3. A50065

T(n,k)=Number of (n+5)X(k+5) 0..1 matrices with each 6X6 subblock idempotent. A224577

Numerators of "Farey fraction" approximations to π. A97545

a(n) = n! * ∑_{i,j,k,l >= 0, i+j+k+l = n} 1/(i!*j!*k!*l!). A92429

Decimal representation of the diagonal from the corner to the origin of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 581", based on the 5-celled von Neumann neighborhood. A289525