Properties of the Number -6281

Two Hundred Eighty-One

Basics

Value: -6282 → -6281 → -6280

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 11 × 571

Divisors: 1, 11, 571, 6281

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

9108 Try Today's Challenge

Representations

Binary: -1100010001001

Octal: -14211

Duodecimal: -3775

Hexadecimal: -1889

Square: 39450961

Square Root: 79.25276020429824

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

Values of n such that L(18) and N(18) 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. A227521

a(n) = 4·n² - 3·n + 1. A54552

Number of integer partitions of n that cannot be partitioned into a set (or multiset) of sets with distinct sums. A381990

Positive integers n such that 2ⁿ == 2¹¹ (mod n). A15935

Numbers whose binary representation traces a nonselfcrossing circuit in honeycomb lattice when its bits (from the least to the second most significant bit) are interpreted as directions to proceed at each vertex. (The most significant 1-bit is ignored). A255571

Odd integers n such that 2ⁿ == 2¹¹ (mod n). A276971

Smallest n-digit triangular number - smallest n-digit number. A95865

a(1) = 1; for n > 1, a(n) = smallest number > a(n-1) such that pairwise sums and (absolute) differences of distinct elements are all distinct. A126428

Number of partitions p of n such that mean(p) >= multiplicity(min(p)). A240079

G.f. A(x) satisfies: A(x) = 1 / ((1 + x) * (1 - x·A(x)³)). A349299