Properties of the Number -257115

Two Hundred Fifty-Seven Thousand One Hundred Fifteen

Basics

Value: -257116 → -257115 → -257114

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 3 × 5 × 61 × 281

Divisors: 1, 3, 5, 15, 61, 183, 281, 305, 843, 915

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -111110110001011011

Octal: -766133

Duodecimal: -104963

Hexadecimal: -3ec5b

Square: 66108123225

Square Root: 507.06508457987917

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) = C(n-1,1) + C(n-3,3) + ... + C(n-2·m-1,2·m+1), where m = floor((n-2)/4). A24490

a(n) = ceiling(Fibonacci(n)/2). A173173

Expansion of (1+x)/((1+x+x²)(1-x-x²)). A93040

Row sums of triangle A099510, so that a(n) = ∑_k=0..n coefficient of z^k in (1 + 2·z + z²)^n-[k/2], where [k/2] is the integer floor of k/2. A99511

a(n) = floor[(φ + n mod 2)*a(n-1)], a(1)=1. A107857

Expansion of g.f. (1+x)²/((1 + x + x²)*(1 + x - x²)). A106511

a(n) = floor((Fibonacci(2·n+1)+1)/2). A87953

a(n) = (A000045(n)+A173432(n))/2. A173433

a(n) = (Fibonacci(3·n-1) + 1)/2 for n >= 1. A292278

Least positive integer k such that the fractional part of k·sqrt(5) has its n initial partial quotients all equal to 1. A4794