ℕ atory
Play Now

Properties of the Number -9529

Five Hundred Twenty-Nine

Basics

Value: -9530 → -9529 → -9528

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 13 × 733

Divisors: 1, 13, 733, 9529

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -10010100111001

Octal: -22471

Duodecimal: -5621

Hexadecimal: -2539

Square: 90801841

Square Root: 97.6165969494942

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 configurations of the sliding block 8-puzzle that require a minimum of n moves to be reached, starting with the empty square in one of the corners. A89473
T(n,k)=Number of nXk binary arrays indicating whether each 2X2 subblock of a larger binary array has lexicographically nondecreasing rows and columns, for some larger (n+1)X(k+1) binary array with rows and columns of the latter in lexicographically nondecreasing order. A227256
Number of squares on infinite half chessboard at <=n knight moves from a fixed point on the diagonal. A98499
Odd semiprimes k = p·q such that k = A325820(p,q), with p, q primes > 3, and A325820 is the carryless base-3 multiplication. A391331
a(n) = (3·9n - 5n)/2. A165149
A (1,3) Somos-4 sequence. A174168
T(3,3n), where T(k,m) is the number of sequences a1,...,am of integers 0,1,...,n with n=floor(m/k) such that the 'bumped' sequence b1,...,bm has exactly k of each of 0,...,n-1, where bi=ai + j (mod n+1) with minimal j>=0 such that b0,...,bi contain at most k elements equal to bi. A6699
a(0)=2; a(n) is the smallest k > a(n-1) such that the fractional part of k1/11 starts with n. A34076
Odd numbers n for which 13 is the smallest i (>= 1) with Jacobi symbol J(i,n) getting either a value 0 or -1. A112076
Square array T(n,m) read by antidiagonals, T(n,m) is the number of (m,n)-parking functions. A260419