Properties of the Number -16113

Sixteen Thousand One Hundred Thirteen

Basics

Value: -16114 → -16113 → -16112

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 12

Digital Root: 3

Palindrome: No

Factorization: 3 × 41 × 131

Divisors: 1, 3, 41, 123, 131, 393, 5371, 16113

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -11111011110001

Octal: -37361

Duodecimal: -93A9

Hexadecimal: -3ef1

Square: 259628769

Square Root: 126.93699224418388

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

Triangle read by rows: A007318^-1 * A011971. A136789

Integers k such that A001006(k) is divisible by k. A266969

a(n) is the first of a triple of consecutive integers, each of which is the product of three distinct primes. A66509

a(n) = ∑_k=0..n A011971(n, k)*(k + 1). The Aitken-Bell triangle considered as a linear transform applied to the positive numbers. A278677

T(n,k) is the number of (n+1) X (k+1) 0..1 arrays x(i,j) with row sums sum{j·x(i,j), j=1..k+1} nondecreasing, and column sums sum{i²*x(i,j), i=1..n+1} nondecreasing. A233366

-7-Knödel numbers. A225511

Hyper-Wiener index of a benzenoid consisting of a double-step zig-zag chain of n hexagons (n >= 2, s = 2123; see the Gutman et al. reference). A193396

a(n) = a(n-1) + a(n-2) + 1, with a(0) = 1 and a(1) = 4. A22318

Triangle T(n,k) of numbers with e.g.f. exp((exp((1+x)*y)-1)/(1+x)), k=0..n-1. A59340

Minimal k > n such that (4·k+3·n) * (4·n+3·k) is a square. A83752