Properties of the Number -27760

Twenty-Seven Thousand Seven Hundred Sixty

Basics

Value: -27761 → -27760 → -27759

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 2 ⁴ × 5 × 347

Divisors: 1, 2, 4, 5, 8, 10, 16, 20, 40, 80

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -110110001110000

Octal: -66160

Duodecimal: -14094

Hexadecimal: -6c70

Square: 770617600

Square Root: 166.61332479726823

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) is the total number of points (both boundary and interior points) in the n-th figure shown in A255011 (meaning the figure with 4n points on the perimeter), where the interior points are counted with multiplicity. A334698

Structured heptagonal anti-diamond numbers (vertex structure 7). A100186

Triangle read by rows: T(n,k) (0 <= k <= n) is the number of Delannoy paths of length n, having k return steps to the line y = x from the line y = x+1 or from the line y = x-1 (i.e., E steps from the line y = x+1 to the line y = x or N steps from the line y = x-1 to the line y = x). A110107

G.f. satisfies A(x) = 1 + 2·x + 2·x³*A(x)³. A367074

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

Numbers n such that A078142(n) = A078142(n+1) = A078142(n+2), where A078142(n) is the sum of the differences of the distinct prime factors p of n and the next square larger than p. A73938

Numbers k such that k and k² use only the digits 0, 1, 2, 6 and 7. A136828

Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 307", based on the 5-celled von Neumann neighborhood. A271166

Number of partitions satisfying cn(0,5) < cn(1,5) + cn(4,5). A39842

a(n) = ∑_k=0..n k·A000009(k). A270105