Properties of the Number -7261

Two Hundred Sixty-One

Basics

Value: -7262 → -7261 → -7260

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 53 × 137

Divisors: 1, 53, 137, 7261

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -1110001011101

Octal: -16135

Duodecimal: -4251

Hexadecimal: -1c5d

Square: 52722121

Square Root: 85.21150157109074

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 -LambertW(-x²*exp(x))/x². A125500

Values of n such that L(10) and N(10) are both prime, where L(k) = (n²+n+1)*2^2·k + (2·n+1)*2^k + 1, N(k) = (n²+n+1)*2^k + n. A227448

a(n) = (9·n² + 3·n + 2)/2. A38764

Numbers n such that the decimal expansions of both n and n² have 1 as smallest digit and 7 as largest digit. A257210

a(n) = 8·n² + 2·n + 1. A188135

T(n,k)=Number of nXk 0..1 arrays with every element unequal to 0, 2, 3 or 4 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero. A318045

Compound filter: a(n) = P(A001511(n), A161942(n)), where P(n,k) is sequence A000027 used as a pairing function. A286260

Square array T(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where T(n,k) = n! * ∑_{j=0..floor(n/2)} (k/2)^j * (j+1)^n-j-1 / (j! * (n-2·j)!). A362377

Number of partial mappings (or mapping patterns) from n points to themselves; number of partial endofunctions. A126285

Expansion of (1 + x)/(1 - x² - 2·x⁵). A237714