Properties of the Number -27686

Twenty-Seven Thousand Six Hundred Eighty-Six

Basics

Value: -27687 → -27686 → -27685

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 29

Digital Root: 2

Palindrome: No

Factorization: 2 × 109 × 127

Divisors: 1, 2, 109, 127, 218, 254, 13843, 27686

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -110110000100110

Octal: -66046

Duodecimal: -14032

Hexadecimal: -6c26

Square: 766514596

Square Root: 166.3911055315157

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

T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing x(i,j)+x(i-1,j) in the j direction. A250877

Numbers k such that σ(k) = σ(k+13). A15883

Number of partitions of n where the difference between consecutive parts is at most 4. A238864

Partial sums of ∑_k=1..n n/gcd(n,k), or partial sums of ∑_d∣n d*φ(d) (see A057660). A174405

a(n) is the number of inversions in all compositions of n. A189052

Integers j not of form 3m+1 such that for any integer k>0, j·10^k-1 has a divisor in the set { 7, 11, 13, 37 }. A243974

Number of (n+1) X (7+1) 0..3 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing x(i,j)+x(i-1,j) in the j direction. A250876

Number of (2+1) X (n+1) 0..3 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing x(i,j)+x(i-1,j) in the j direction. A250879

Convolution of A000041 and A000290. A360486