Properties of the Number -5034

Thirty-Four

Basics

Value: -5035 → -5034 → -5033

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 12

Digital Root: 3

Palindrome: No

Factorization: 2 × 3 × 839

Divisors: 1, 2, 3, 6, 839, 1678, 2517, 5034

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -1001110101010

Octal: -11652

Duodecimal: -2AB6

Hexadecimal: -13aa

Square: 25341156

Square Root: 70.95068710026705

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

Expansion of ∏_m>=1 (1+q^m)^-3. A22598

E.g.f. satisfies y'' + y' - x³*y = 0 with y(0)=1, y'(0)=0. A318355

Triangle read by rows: T(n,k) = (-1)ⁿ * n! + (-1)^k+1 * k! for n >= 2 and 1 <= k <= n-1. A373967

Number of regions that the line segments in A091908(n) cut the equilateral triangle into. A92098

Numbers m such that the factorizations of m..m+3 have the same number of primes (including multiplicities). A45940

Numbers m such that the factorizations of m..m+4 have the same number of primes (including multiplicities). A45941

Square array read by antidiagonals: T(m,n) = number of ways of creating a closed, simple loop on an m X n rectangular lattice. A231829

Triangle read by rows: T(m,n) = ∑_{-m<i<m, -n<j<n, gcd{i,j}=1} (m-|i|)*(n-|j|), m >= n >= 1. A332350

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

Poincaré series for invariant polynomial functions on the space of binary forms of degree 14. A293939