Properties of the Number -12051

Twelve Thousand Fifty-One

Basics

Value: -12052 → -12051 → -12050

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 9

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 13 × 103

Divisors: 1, 3, 9, 13, 39, 103, 117, 309, 927, 1339

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -10111100010011

Octal: -27423

Duodecimal: -6B83

Hexadecimal: -2f13

Square: 145226601

Square Root: 109.77704678119193

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

Hexagonal pyramidal numbers, or greengrocer's numbers. A2412

a(n) = n*(8·n - 3). A139273

Number of decagons that can be formed with perimeter n. A288256

Numbers k such that σ(k) = ψ(k) + τ(k) + π(k). A389855

Self-inverse permutation of natural numbers: a(0) = 0, a(1) = 1, and for n > 1, if A117966(n) < 0, a(n) = A117967(1+a(-(A117966(n)))), otherwise a(n) = A117968(a(A117966(n)-1)). A246211

Triangle read by rows: T(n,k) is the coefficient A_k in the transformation ∑_k=0..n (k+1)*x^k = ∑_k=0..n A_k*(x+2)^k. A246788

Odd hexagonal pyramidal numbers. A15225

Number of binary rooted trees with n nodes and height exactly 9. A36598

Let M be the matrix defined in A111490. Sequence gives M(2,1)-M(1,2), M(2,1)+M(3,1)+M(3,2)-M(1,2)-M(1,3)-M(2,3), etc. A123329

a(n) = (10·n+3)*(10·n+17). A152579