Properties of the Number -8274

Two Hundred Seventy-Four

Basics

Value: -8275 → -8274 → -8273

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 2 × 3 × 7 × 197

Divisors: 1, 2, 3, 6, 7, 14, 21, 42, 197, 394

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -10000001010010

Octal: -20122

Duodecimal: -4956

Hexadecimal: -2052

Square: 68459076

Square Root: 90.96153033013462

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

G.f.: ∑_n>=0 (n+1) * xⁿ * (1 + xⁿ)ⁿ / (1 + xⁿ⁺¹)ⁿ⁺². A326285

Expansion of e.g.f. 1/(1 - x·exp(x) + x²*exp(2·x)). A2983

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

Numbers n such that Bernoulli number B_n has denominator 1806. A272139

Dirichlet convolution of b_n = 2^n-1 with φ(n). A34738

Coefficients of a special case of Poisson-Charlier polynomials. A46716

Sum of primitive roots of n-th prime. A88144

T(n,k)=Number of length-n 0..k arrays with no following elements greater than or equal to the first repeated value. A267232

T(n,k)=Number of (n+3)X(k+3) binary arrays with every 4X4 subblock commuting with each horizontal and vertical neighbor 4X4 subblock. A188105

T(n,k) = number of (n+1) X (k+1) 0..2 arrays with the number of clockwise edge increases in every 2 X 2 subblock unequal to the number of counterclockwise edge increases. A205823