Properties of the Number -2272

Two Hundred Seventy-Two

Basics

Value: -2273 → -2272 → -2271

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 13

Digital Root: 4

Palindrome: No

Factorization: 2 ⁵ × 71

Divisors: 1, 2, 4, 8, 16, 32, 71, 142, 284, 568

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -100011100000

Octal: -4340

Duodecimal: -1394

Hexadecimal: -8e0

Square: 5161984

Square Root: 47.66550115125194

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

Array: row n shows the coefficients of the characteristic polynomial of the n-th principal submatrix of f(i,j) = gcd(prime(i), prime(j)) (A204118). A204119

Start with 2, then successively subtract the primes 3, 5, 7, ... A282329

Expansion of sin(tan(x)*x)/2. A24248

Number of partitions of n-set with distinct block sizes. A7837

Number of parts in all partitions of n into distinct parts. A15723

Numbers k whose abundance σ(k) - 2·k = -8. Numbers k whose deficiency is 8. A125247

Fibonacci-Pascal triangle read by rows. A36355

Triangle read by rows: T(n,k) = number of vertices in a "frame" of size n X k (see Comments in A331457 for definition). A332599

a(n) = (n-1)*(2·n+5). A130861

Number of ways to split a strict integer partition of n into consecutive subsequences with strictly decreasing sums. A318684