Properties of the Number -186480

One Hundred Eighty-Six Thousand Four Hundred Eighty

Basics

Value: -186481 → -186480 → -186479

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 2 ⁴ × 3 ² × 5 × 7 × 37

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

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

9108 Try Today's Challenge

Representations

Binary: -101101100001110000

Octal: -554160

Duodecimal: -8BB00

Hexadecimal: -2d870

Square: 34774790400

Square Root: 431.83330117071796

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

Coefficients of the signed Fubini polynomials in ascending order, F_n(x) = ∑_k=0..n (-1)ⁿ*Stirling2(n,k)*k!*(-x)^k. A278075

Expansion of e.g.f. arcsinh(tanh(x) * exp(x)). A12661

Triangle of numbers T(n,k) = k!*Stirling2(n,k) read by rows (n >= 1, 1 <= k <= n). A19538

Triangle of numbers T(n,k) = k!*Stirling2(n,k) = A000142(k)*A048993(n,k) read by rows, T(n, k) for 0 <= k <= n. A131689

T(n, k) = ∑_j=0..n-k (-1)^j*binomial(n - k + 1, j)*(n - k + 1 - j)ⁿ. Triangle read by rows, T(n, k) for 1 <= k <= n. A90582

a(n) = 4ⁿ - C(4,3)*3ⁿ + C(4,2)*2ⁿ - C(4,1). A919

Palindromes using exactly four different symbols. A56455

G.f.: ∑_n>=0 (n+x)ⁿ * xⁿ / (1 + n·x + x²)ⁿ. A187742

Number of periodic palindromes using exactly four different symbols. A56490

Number of closed paths of length n whose steps are 12th roots of unity, U₁₂(n). A198808