9529
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 25
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 10276
- Proper Divisor Sum (Aliquot Sum)
- 747
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8784
- Möbius Function
- 1
- Radical
- 9529
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 2
Special
- Factorial
- no
- Catalan Number
- no
- Bell Number
- no
- Motzkin Number
- no
- Primorial
- no
Figurate Numbers
- Fibonacci Number
- no
- Triangular Number
- no
- Perfect Square
- no
- Perfect Cube
- no
- Pentagonal Number
- no
- Hexagonal Number
- no
- Lucas Number
- no
- Tetrahedral Number
- no
- Pell Number
- no
- Tribonacci Number
- no
- Pronic Number
- no
Recreational
- Happy Number
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 104
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- Squarefree Number
- yes
- Prime Power
- no
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Class numbers associated with terms of A001988.at n=23A001989
- T(3,3n), where T(k,m) is the number of sequences a_1,...,a_m of integers 0,1,...,n with n=floor(m/k) such that the 'bumped' sequence b_1,...,b_m has exactly k of each of 0,...,n-1, where b_i=a_i + j (mod n+1) with minimal j>=0 such that b_0,...,b_i contain at most k elements equal to b_i.at n=3A006699
- Numbers k such that the continued fraction for sqrt(k) has period 89.at n=10A020428
- a(0)=2; a(n) is the smallest k > a(n-1) such that the fractional part of k^(1/11) starts with n.at n=30A034076
- Decimal part of cube root of a(n) starts with 2: first term of runs.at n=20A034128
- 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.at n=18A089473
- Number of squares on infinite half chessboard at <=n knight moves from a fixed point on the diagonal.at n=37A098499
- Odd numbers n for which 13 is the smallest i (>= 1) with Jacobi symbol J(i,n) getting either a value 0 or -1.at n=30A112076
- a(n) = (3*9^n - 5^n)/2.at n=4A165149
- A (1,3) Somos-4 sequence.at n=6A174168
- a(n) = A175369(n^2).at n=14A175370
- G.f. A(x) given by A(x) = 1+x*A(x)^2+x^2*A(x)^4+2*x^3*A(x)^6.at n=7A186242
- Number of nX3 binary arrays indicating whether each 2X2 subblock of a larger binary array has lexicographically nondecreasing rows and columns, for some larger (n+1)X4 binary array with rows and columns of the latter in lexicographically nondecreasing order.at n=7A227253
- 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.at n=47A227256
- 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.at n=52A227256
- Number of (n+1)X(1+1) 0..1 arrays x(i,j) with row sums sum{j^4*x(i,j), j=1..1+1} nondecreasing, and column sums sum{i^4*x(i,j), i=1..n+1} nondecreasing.at n=38A232790
- Square array T(n,m) read by antidiagonals, T(n,m) is the number of (m,n)-parking functions.at n=63A260419
- Numbers k such that both k and k+1 are sums of two positive squares in 2 or more ways.at n=38A333443
- a(n) = 8*a(n-1) - 21*a(n-2) + 20*a(n-3) - 5*a(n-4), with initial terms a(0)=1, a(1)=7, a(2)=35, a(3)=154.at n=6A336602
- a(n) = Sum_{k=1..n} k * floor(sqrt(2*k-1)).at n=49A349489