Properties of the Number -17728

Seventeen Thousand Seven Hundred Twenty-Eight

Basics

Value: -17729 → -17728 → -17727

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 2 ⁶ × 277

Divisors: 1, 2, 4, 8, 16, 32, 64, 277, 554, 1108

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -100010101000000

Octal: -42500

Duodecimal: -A314

Hexadecimal: -4540

Square: 314281984

Square Root: 133.1465358167459

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 1 / ∑_n=-oo..oo x^n². A4402

E.g.f.: ∑_n>=0 2^-n*(n+1/2!) * ∏_k=0..n tanh(2^k*x). A194457

Number of overpartitions of n: an overpartition of n is an ordered sequence of nonincreasing integers that sum to n, where the first occurrence of each integer may be overlined. A15128

Number of integer partitions of n with parts disjoint from first differences of parts, meaning no part is the difference of two consecutive parts. A363260

T(n,k) is the number of (n+1) X (k+1) 0..5 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 3, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings). A235026

Number of factorizations of 2ⁿ into factors > 1 with integer average. A326667

Start with the square tile of the Shield tiling and recursively apply the substitution rule. a(n) is the number of triangles with 6 markings after n iterations. A298681

The number of edges on an octagon formed by the straight line segments mutually connecting all vertices and all points that divide the sides into n equal parts. A333110

Number of subgroups of the group C_n X C_n X C_n (where C_n is the cyclic group of order n). A64803

Table read by antidiagonals: Place k equally spaced points 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 the number of edges in the resulting planar graph. A367324