Properties of the Number -774144

Seven Hundred Seventy-Four Thousand One Hundred Forty-Four

Basics

Value: -774145 → -774144 → -774143

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 2 ¹² × 3 ³ × 7

Divisors: 1, 2, 3, 4, 6, 7, 8, 9, 12, 14

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8109 Try Today's Challenge

Representations

Binary: -10111101000000000000

Octal: -2750000

Duodecimal: -314000

Hexadecimal: -bd000

Square: 599298932736

Square Root: 879.8545334315213

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 triangle of coefficients of a Moebius-transformed Pascal triangle as a sum: b(x,y,n)=Sum[Binomial[n,i]*xⁱ*y^n-i,{i,0,n}]; transforms: x'->(a1·x + b1)/(c1·x + d1); y'->(a2·y + b2)/(c2·y + d2); b1(x,y,n)=(c1·x + b1)^k*(c2·y + d2)^k*b(x',y',n); f(x,y,z,n)=b1(x,y,n)+b1(y,z,n)+b1(z,x,n). A139815

16-almost primes (generalization of semiprimes). A69277

Numbers of multiplicative persistence 4 which are themselves the product of digits of a number. A350183

Triangle T(n,k) of number of minimal 3-covers of a labeled n-set that cover k points of that set uniquely (k=3,..,n). A57964

Triangle T(n, k) = n!*q^k/(n-k)! if floor(n/2) > k-1 otherwise n!*q^n-k/k!, with q = 4, read by rows. A174378

(1/2)*A075998. A76001

Triangle whose (i,j)-th entry is binomial(i,j)*4^i-j*6^j. A38236

Triangle whose (i,j)-th entry is binomial(i,j)*6^i-j*4^j. A38258

Number of reduced words of length n in Coxeter group on 3 generators S_i with relations (S_i)² = (S_i S_j)¹⁰ = I. A165745

Numbers k such that k·product_of_digits(k) is a nonzero cube. A229544