ℕ atory
Play Now

Properties of the Number -7102

One Hundred Two

Basics

Value: -7103 → -7102 → -7101

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 10

Digital Root: 1

Palindrome: No

Factorization: 2 × 53 × 67

Divisors: 1, 2, 53, 67, 106, 134, 3551, 7102

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -1101110111110

Octal: -15676

Duodecimal: -413A

Hexadecimal: -1bbe

Square: 50438404

Square Root: 84.27336471270148

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

Number of integer partitions of n whose run-lengths are either weakly increasing or weakly decreasing. A332745
T(n,k)=Number of nondecreasing -k..k vectors of length n whose dot product with some lexicographically greater or equal nondecreasing -k..k vector equals n. A226422
Intrinsic 9-palindromes: n is an intrinsic k-palindrome if it is a k-digit palindrome in some base. A60879
Binomial transform of [1, 1, 7, 7, 7, ...]. A131068
Numbers n such that A234519(n) = n. A234524
Expansion of ∏k>=1 1/(1 - xk)sigma6(k). A301544
Number of partitions of n in SPM(n): these are the partitions obtained from (n) by iteration of the following transformation: p -> p' if p' is a partition (i.e., decreasing) and p' is obtained from p by removing a unit from the i-th component of p and adding one to the (i+1)-th component, for any i. A56219
For even k >= 4, let f(k) = A066285(k/2) be the minimal difference between primes p and q whose sum is k. Such a k is in the sequence if f(k) > f(m) for all even m with 4 <= m < k. A65978
a(n) = prime(prime(prime(A028815(n) - 1) - 1) - 1) - 1. A141133
T(n,k)=Majority value maps: number of nXk binary arrays indicating the locations of corresponding elements equal to at least half of their horizontal, diagonal and antidiagonal neighbors in a random 0..2 nXk array. A220922