Properties of the Number -21765

Twenty-One Thousand Seven Hundred Sixty-Five

Basics

Value: -21766 → -21765 → -21764

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 3 × 5 × 1451

Divisors: 1, 3, 5, 15, 1451, 4353, 7255, 21765

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -101010100000101

Octal: -52405

Duodecimal: -10719

Hexadecimal: -5505

Square: 473715225

Square Root: 147.52965803525743

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+1) X (k+1) 0..2 arrays with row and column sums nondecreasing, and no adjacent elements equal. A233408

Base-7 digits are, in order, the first n terms of the periodic sequence with initial period 1,2,0,3. A37691

a(n) is the number of terms in the expansion of (x-y)*(x⁴-y⁴)*(x⁹-y⁹)*...*(x^n²-y^n²). A225549

Numbers k such that 231·2^k+1 is prime. A32492

Number of length n+5 0..2 arrays with at most one downstep in every n consecutive neighbor pairs. A255112

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 0, 1), (0, 0, -1), (0, 1, 1), (1, 0, 0)}. A150197

Number of (n+1)X(4+1) 0..2 arrays with row and column sums nondecreasing, and no adjacent elements equal. A233405

Number of (n+1)X(6+1) 0..2 arrays with row and column sums nondecreasing, and no adjacent elements equal. A233407