Properties of the Number -77701

Seventy-Seven Thousand Seven Hundred One

Basics

Value: -77702 → -77701 → -77700

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 13 × 43 × 139

Divisors: 1, 13, 43, 139, 559, 1807, 5977, 77701

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -10010111110000101

Octal: -227605

Duodecimal: -38B71

Hexadecimal: -12f85

Square: 6037445401

Square Root: 278.7489910295641

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 the upper median equal to the lower median in every 2X2 subblock. A235981

Square array T(n, k) = ∏_j=1..n ( ∑_i=0..j-1 ((k+1)² - (k+1))ⁱ ) with T(n, 0) = n!, read by antidiagonals. A156881

a(n) is the smallest positive integer which can be represented as the sum of distinct nonzero n-gonal pyramidal numbers in exactly n ways, or 0 if no such integer exists. A350210

p(p²-p+1) as p runs through the primes. A83558

Number of (binary) max-heaps on 2n elements from the set {0,1} containing n 0's and n 1's. A309050

Number of (n+1) X (1+1) 0..2 arrays with the upper median equal to the lower median in every 2 X 2 subblock. A235974

Number of (n+1)X(6+1) 0..2 arrays with the upper median equal to the lower median in every 2X2 subblock. A235979

a(n) = m is the least m = b·c > a(n-1) such that (b+c)*n = m-1 where 1 < b <= c < m. A364171