Properties of the Number -16740

Sixteen Thousand Seven Hundred Forty

Basics

Value: -16741 → -16740 → -16739

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 2 ² × 3 ³ × 5 × 31

Divisors: 1, 2, 3, 4, 5, 6, 9, 10, 12, 15

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -100000101100100

Octal: -40544

Duodecimal: -9830

Hexadecimal: -4164

Square: 280227600

Square Root: 129.38315191708693

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

Expansion of ∏_m>=1 ((1+q^2·m-1)/(1+q^2·m))⁵. A29842

Triangle read by rows: T[n,k] = number of n X n binary matrices with k=0...n² ones, distinct up to cyclic shifts of rows and columns; reflection through any vertical or horizontal axis; and reflection through the main diagonal. Also, quasi-n-ominoes on a torus divided into a k X k grid. A93466

Numbers k such that σ (x) = k has exactly 11 solutions. A60678

Triangle read by rows, S₄(n, k) where S_m(n, k) are the Stirling-Frobenius subset numbers of order m; n >= 0, k >= 0. A225469

a(n) = ∑_i=0..n digsum(i)³, where digsum(i) = A007953(i). A231688

a(n) = A332214(n) - n, where A332214 is the Mersenne-prime fixing variant of permutation A163511. A366372

Triangle read by rows: T(n,k) = number of simple graphs on n labeled nodes with k edges that are node-disjoint unions of undirected cycle subgraphs. A144161

a(n) = ∑_i=0..n digsum₉(i)³, where digsum₉(i) = A053830(i). A231686

Table read by antidiagonals: Place k points in general position on each side of a regular n-gon and join every pair of the n*(k+1) boundary points by a chord; T(n,k) (n >= 3, k >= 0) gives number of vertices in the resulting planar graph. A367183

Square array A(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where column k is the expansion of B(x)^k, where B(x) is the g.f. of A381600. A381592