Properties of the Number -427680

Four Hundred Twenty-Seven Thousand Six Hundred Eighty

Basics

Value: -427681 → -427680 → -427679

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 2 ⁵ × 3 ⁵ × 5 × 11

Divisors: 1, 2, 3, 4, 5, 6, 8, 9, 10, 11

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8109 Try Today's Challenge

Representations

Binary: -1101000011010100000

Octal: -1503240

Duodecimal: -187600

Hexadecimal: -686a0

Square: 182910182400

Square Root: 653.9724764850582

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

Numbers that have exactly two exponents in their prime factorization that are equal to 5. A386809

a(n) = binomial(n+7,7)*6ⁿ. A141407

T(n,k) = Number of (n+1) X (k+1) 0..3 arrays colored with the maximum plus the upper median minus the lower median minus the minimum of every 2 X 2 subblock. A236202

Triangle read by rows: T(n,k) is the coefficient A_k in the transformation of 1 + x + x² + ... + xⁿ to the polynomial A_k*(x+k)^k for 0 <= k <= n. A248826

Table (read by antidiagonals): t(1,n) = t(m,1) = 1 for all m and n. t(m,n) = (sum{k=1 to m-1} t(k,n)) * (sum{k=1 to n-1} t(m,k)). A124976

Number of (n+1)X(1+1) 0..3 arrays colored with the maximum plus the upper median minus the lower median minus the minimum of every 2X2 subblock. A236199

A008336(n) is divisible by the product of the primes p such that n/2 <= p < n; a(n) is the quotient. A370971