Properties of the Number -261376

Two Hundred Sixty-One Thousand Three Hundred Seventy-Six

Basics

Value: -261377 → -261376 → -261375

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 2 ⁸ × 1021

Divisors: 1, 2, 4, 8, 16, 32, 64, 128, 256, 1021

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

9108 Try Today's Challenge

Representations

Binary: -111111110100000000

Octal: -776400

Duodecimal: -107314

Hexadecimal: -3fd00

Square: 68317413376

Square Root: 511.24944987745465

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

T(n,k)=Sum of neighbor maps: number of nXk binary arrays indicating the locations of corresponding elements equal to the sum mod 3 of their horizontal and antidiagonal neighbors in a random 0..2 nXk array. A222386

a(n) = 4·n⁴ - 3·n². A79414

Decimal representation of the x-axis, from the left edge to the origin, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 313", based on the 5-celled von Neumann neighborhood. A281041

Composite c such that σ(c)==2 (mod φ(c)). A67192

a(n) = ∑_k=0..n 2^max(k, n-k). A107659

Indices of records in A389240. A386819

Sum of neighbor maps: number of n X 3 binary arrays indicating the locations of corresponding elements equal to the sum mod 3 of their horizontal and antidiagonal neighbors in a random 0..2 n X 3 array. A222382