Properties of the Number -61965

Sixty-One Thousand Nine Hundred Sixty-Five

Basics

Value: -61966 → -61965 → -61964

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 3 ⁶ × 5 × 17

Divisors: 1, 3, 5, 9, 15, 17, 27, 45, 51, 81

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -1111001000001101

Octal: -171015

Duodecimal: -2BA39

Hexadecimal: -f20d

Square: 3839661225

Square Root: 248.92770034690795

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) = a(n-1) + a(n-2) - 2^n-1 with a(0)=a(2)=0, a(1)=-a(3)=1, a(4)=-5. A227200

T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with each row divisible by 3 and column not divisible by 3, read as a binary number with top and left being the most significant bits. A262420

a(n) = ∑_k=1..n+1 A027960(n+1, n+1+k). A27974

Expansion of ∑_k>=1 ((1 + k·x^k)^k - 1). A327238

Triangle T(n,k) read by rows, arising in enumeration of catafusenes. A24462

Second binomial transform of C(n+2,2). A81892

Inverse binomial transform of A014217. A142585

Odd numbers divisible by exactly 8 primes (counted with multiplicity). A46321

Duplicate of A027974. A27983

Number of (n+1) X (3+1) 0..1 arrays with each row divisible by 3 and column not divisible by 3, read as a binary number with top and left being the most significant bits. A262415