Properties of the Number -10912

Ten Thousand Nine Hundred Twelve

Basics

Value: -10913 → -10912 → -10911

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 13

Digital Root: 4

Palindrome: No

Factorization: 2 ⁵ × 11 × 31

Divisors: 1, 2, 4, 8, 11, 16, 22, 31, 32, 44

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -10101010100000

Octal: -25240

Duodecimal: -6394

Hexadecimal: -2aa0

Square: 119071744

Square Root: 104.46051885760477

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·binomial(n,3). A7290

Table read by rows: T(n,k) = number of k-gons, k >= 3, formed inside a square with edge length 1 by the straight line segments mutually connecting all vertices and points that divide the sides into segments with lengths equal to the Farey series of order n = A006842(n,m)/A006843(n,m), m = 1..A005728(n). A358889

a(n) = floor(n*φ¹⁵), where φ is the golden ratio, A001622. A4930

Numbers with exactly 2 odd integers in their Collatz (or 3x+1) trajectory. A62052

Convolved with its aerated variant = A000041. A174065

Rectangular table, read by antidiagonals, such that the g.f. of row n, R_n(y), satisfies: R_n(y) = [ ∑_k>=0 y^k * R_k(y)ⁿ ]ⁿ for n>=0, with R₀(y) = 1. A124540

Coefficients of the '6th-order' mock θ function ρ(q). A53270

T(n,k) = Number of (n+1) X (k+1) 0..2 arrays colored with the difference of the maximum and the upper median in each 2 X 2 subblock. A236096

a(n) = ∑_k=1..n μ(k)*k³. A336277

a(n) = 8·Lucas(n). A258160