Properties of the Number -4342

Three Hundred Forty-Two

Basics

Value: -4343 → -4342 → -4341

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 13

Digital Root: 4

Palindrome: No

Factorization: 2 × 13 × 167

Divisors: 1, 2, 13, 26, 167, 334, 2171, 4342

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -1000011110110

Octal: -10366

Duodecimal: -261A

Hexadecimal: -10f6

Square: 18852964

Square Root: 65.89385403814228

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} (1+x²ⁿ⁺¹)/(1-x²ⁿ⁺¹). A80054

T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row and diagonal sum equal to 0 2 4 6 or 7 and every 3X3 column and antidiagonal sum not equal to 0 2 4 6 or 7. A252433

Numbers obtained by reinterpreting base-2 representation of n in A001563-base (A276326): a(n) = ∑_k>=0 A030308(n,k)*A001563(k+1). A276091

Matula-Goebel numbers of semi-lone-child-avoiding rooted identity trees. A331963

Number of integer partitions of n with all equal lengths of maximal gapless runs (decreasing by 0 or 1). A384887

a(1) = 1; for n > 1, a(n) = n concatenated with n - 1. A127423

Numbers k such that τ(k) = τ(k+1) mod 691, where τ is Ramanujan's τ function A000594. A121733

Positions of 16 after decimal point in decimal expansion of π. A134216

T(n,k)=Number of nXk 0..4 arrays with each element·equal to the number of its horizontal and vertical neighbors equal to 4,1,2,0,3 for x=0,1,2,3,4. A196967

Expansion of φ(q²) / φ(-q) in powers of q where φ() is a Ramanujan θ function. A208850