Properties of the Number -5102

One Hundred Two

Basics

Value: -5103 → -5102 → -5101

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 8

Digital Root: 8

Palindrome: No

Factorization: 2 × 2551

Divisors: 1, 2, 2551, 5102

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -1001111101110

Octal: -11756

Duodecimal: -2B52

Hexadecimal: -13ee

Square: 26030404

Square Root: 71.42828571371429

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

Triangle of T(n,k) coefficients of polynomials with first n prime numbers as roots. A70918

Triangle read by rows: T(n,k) is coefficient of x^n-k in consecutive prime rooted polynomial of degree n, P(x) = ∏_k=1..n (x-p(k)) = 1·xⁿ + T(n,1)*x^n-1+ ... + T(n,k-1)*x + T(n,k), for 1 <= k <= n. A238146

Expansion of ∏_k>0 1/theta₃(q^2·k-1), where theta₃() is the Jacobi θ function. A320098

a(n) is the coefficient of xⁿ in the polynomial ∏_i=1..n+3 (prime(i)*x-1). A309803

Number of partitions of n in which the greatest part is 7. A26813

Number of arrangements of n circles in the affine plane with the property that every circle intersects all the other circles. A288554

T(n,k)=Number of length n+5 0..k arrays with no six consecutive terms having the maximum of any three terms equal to the minimum of the remaining three terms. A250014

Number of square binary words: binary words of length 2n obtained by self-shuffling. A191755

Numbers of the form i·9^j-1 (i=1..8, j >= 0). A140576

Numbers k such that k⁸ == 1 (mod 9³). A56084