Properties of the Number -12771

Twelve Thousand Seven Hundred Seventy-One

Basics

Value: -12772 → -12771 → -12770

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 3 ³ × 11 × 43

Divisors: 1, 3, 9, 11, 27, 33, 43, 99, 129, 297

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -11000111100011

Octal: -30743

Duodecimal: -7483

Hexadecimal: -31e3

Square: 163098441

Square Root: 113.00884921102418

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/2)*(n+2)*(n² - 6·n - 1). A28494

3 times 10-gonal (or decagonal) numbers: a(n) = 3·n*(4·n-3). A152767

T(n,k)=Number of nXk 0..1 arrays with no 1 equal to more than three of its king-move neighbors. A282399

Sum of the two smallest parts from the partitions of 4n into 4 parts with smallest part = 1. A239059

p² + 2 where p is a prime. A61725

Number of partitions of 5n such that cn(1,5) = cn(4,5) < cn(0,5) < cn(2,5) = cn(3,5). A36894

Total sum of Fibonacci parts in all partitions of n. A199936

Let i be in {1,2,3,4} and let r >= 0 be an integer. Let p = {p₁, p₂, p₃, p₄} = {-2,0,1,2}, n=3·r+p_i, and define a(-2)=0. Then a(n)=a(3·r+p_i) gives the quantity of H_9,2,0 tiles in a subdivided H_9,i,r tile after linear scaling by the factor Q^r, where Q=sqrt(x²-1) with x=2·cos(π/9). A187500

Numbers whose binary representation is palindromic and in which all runs of 0's and 1's have length at least 2. A222813

a(n) = ∑_{k=0..floor(n/6)} (-1)^k * binomial(n-3·k,3·k). A348308