Properties of the Number -35765

Thirty-Five Thousand Seven Hundred Sixty-Five

Basics

Value: -35766 → -35765 → -35764

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 26

Digital Root: 8

Palindrome: No

Factorization: 5 × 23 × 311

Divisors: 1, 5, 23, 115, 311, 1555, 7153, 35765

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -1000101110110101

Octal: -105665

Duodecimal: -18845

Hexadecimal: -8bb5

Square: 1279135225

Square Root: 189.1163662933486

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)=Number of (n+2)X(k+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000000 00000001 or 00000101. A259952

Numbers k such that there are exactly four biquadratefree powerful numbers (A338325) between k² and (k+1)². A338391

Sum of terms in n-th row of A077316. A77318

Start with Pascal's triangle; form a rhombus by sliding down n steps from top on both sides then sliding down inwards to complete the rhombus and then deleting the inner numbers; a(n) = sum of entries on perimeter of rhombus. A81495

Number of (n+2) X (n+2) 0..1 arrays with each 3 X 3 subblock having clockwise perimeter pattern 00000000 00000001 or 00000101. A259944

Number of (n+2)X(4+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000000 00000001 or 00000101. A259948

Numbers k such that k![4] - 32 is prime, where k![4] = A007662(k) = quadruple factorial. A329167