Properties of the Number -4179

One Hundred Seventy-Nine

Basics

Value: -4180 → -4179 → -4178

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 3 × 7 × 199

Divisors: 1, 3, 7, 21, 199, 597, 1393, 4179

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -1000001010011

Octal: -10123

Duodecimal: -2503

Hexadecimal: -1053

Square: 17464041

Square Root: 64.64518543557594

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

The r-th term of the n-th row of the following array contains the sum of r successively decreasing integers beginning from n. 0 < r <= n. Sequence contains the leading diagonal. A110427

Partial sums of (-1)ⁿ*Fibonacci(n-1). A112469

Matrix inverse of triangle A122178, where A122178(n,k) = C( n*(n+1)/2 + n-k - 1, n-k) for n>=k>=0. A121438

Expansion of 1/(1 - x*(1 - 11·x)). A146083

Partial sums of F(1) - L(1) + F(2) - L(2) + F(3) - L(3) + ..., where F = A000045 and L = A000032. A355018

a(n) = Fibonacci(n+3) - 2. A1911

Regular triangle read rows: T(n,k) = number of non-isomorphic multiset partitions of size n and length k. A317533

Number of unimodal partitions/compositions of n into distinct terms. A72706

Number of partitions of n having no more odd than even parts. A171966

Triangle read by rows: T(n,k) are the coefficients of Charlier polynomials: A046716 transposed, for 0 <= k <= n. A94816