Properties of the Number -2270

Two Hundred Seventy

Basics

Value: -2271 → -2270 → -2269

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 11

Digital Root: 2

Palindrome: No

Factorization: 2 × 5 × 227

Divisors: 1, 2, 5, 10, 227, 454, 1135, 2270

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -100011011110

Octal: -4336

Duodecimal: -1392

Hexadecimal: -8de

Square: 5152900

Square Root: 47.644516998286385

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

G.f. satisfies A(x) = 1 + x/A(x)³*(1 + 1/A(x)). A364398

Bessel polynomial {y_n}'(-2). A65707

a(n) = ∑_{k=0..floor(n/3)} (-1)^k * binomial(n-1-2·k,n-3·k) * binomial(2·k,k). A360314

Numbers m such that the Bernoulli number B_m has denominator 66. A51230

Number of strict integer partitions of n with at least one neighborless part. A356607

a(n) = ∑_{k=0..floor(n/2)} A026626(n-k, k). A26636

Number of integer partitions of n with more adjacent equal parts than distinct parts. A360254

a(n) = ∑_j=1..n j·prime(j). A14285

Expansion of (1-2x²)/(1-x-3x²+2x⁴). A52962

Triangle read by rows: T(n,k) = number of primitive (period n) n-bead bracelet structures using exactly k different colored beads. A276543