Properties of the Number 8530

Eight Thousand Five Hundred Thirty

Basics

Value: 8529 → 8530 → 8531

Parity: even

Prime: No

Previous Prime: 8527

Next Prime: 8537

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 2 × 5 × 853

Divisors: 1, 2, 5, 10, 853, 1706, 4265, 8530

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 10000101010010

Octal: 20522

Duodecimal: 4B2A

Hexadecimal: 2152

Square: 72760900

Square Root: 92.35799911215054

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

Sum of the emergent parts of the partitions of n. A182709

Number of positive walks with n steps {-3,-2,-1,0,1,2,3} starting at the origin, ending at altitude 1, and staying strictly above the x-axis. A276902

Expansion of ∏_k>=1 1/(1 - x^k²)². A279225

a(n) = ∑_{1 <= i, j, k <= n} gcd(i,j,k). A344522

Digitally balanced numbers in base 6: equal numbers of 0's, 1's, ..., 5's. A49357

Sum of terms in level n of TRIP - Stern sequence associated with permutation triple (e, e, e). A278612

Triangle, read by rows, where the n-th row lists the coefficients of the polynomial of degree n, with root -1, that generates the n-th diagonal of this sequence. A91173

Leftmost column of triangle A091173, in which the n-th row lists the coefficients of the polynomial that generates the n-th diagonal. A91174

Numbers in which 0,1,2,3,4,5 all occur in base 6. A31947

Let f(m) = number of steps needed to reach a Harshad number when the map k->A062028(l) is iterated starting at m; a(n) = smallest m such that f(m) = n. A181664