Properties of the Number -73789

Seventy-Three Thousand Seven Hundred Eighty-Nine

Basics

Value: -73790 → -73789 → -73788

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 34

Digital Root: 7

Palindrome: No

Factorization: 113 × 653

Divisors: 1, 113, 653, 73789

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8109 Try Today's Challenge

Representations

Binary: -10010000000111101

Octal: -220075

Duodecimal: -36851

Hexadecimal: -1203d

Square: 5444816521

Square Root: 271.64130760986995

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

Central trinomial coefficients: largest coefficient of (1 + x + x²)ⁿ. A2426

Sum of the squares of the trinomial coefficients (A027907). A82758

Square array T(n,k), n >= 0, k >= 0, read by antidiagonals, where column k is the expansion of sqrt((1+(k-4)*x+sqrt(1-2*(k+4)*x+((k-4)*x)²)) / (2 * (1-2*(k+4)*x+((k-4)*x)²))). A337389

Triangle read by rows: T(n,k) is the number of paths in the right half-plane from (0,0) to (n,0), consisting of steps U=(1,1), D=(1,-1), h=(1,0) and H=(2,0), having k H=(2,0) steps (0 <= k <= floor(n/2)). A132885

Number of symmetric, reduced unit interval schemes with n+1 intervals (n>=1). A5213

Array read by ascending antidiagonals: the s-th column gives the central s-binomial coefficients. A349933

T(n,k) = largest coefficient in the expansion of (1 + ... + x^n-1)^2·k. A163269

Number of n X 12 0..2 arrays with row sums 12 and column sums n. A172640

a(n) = ∑_k=0..n C(n,k)*((-1)ⁿ*(C(k,n-k)-C(k,n-k-1))+C(n-k,k+1)). A273020

Numerators of the coefficients of (x-1)(x-2)... in the interpolating polynomial through the first n primes. A118210