9530
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 17172
- Proper Divisor Sum (Aliquot Sum)
- 7642
- 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
- 3808
- Möbius Function
- -1
- Radical
- 9530
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 3
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
- 52
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- yes
- Odd
- no
Appears in sequences
- Coordination sequence for Cr3Si, Cr position.at n=25A009928
- a(n) = floor( n*(n-1)*(n-2)/25 ).at n=63A011907
- Length of hypotenuse squared in right triangle formed by a prime spiral plotted in Cartesian coordinates.at n=19A048851
- Numbers k such that binomial(2k,k)+1 is prime.at n=33A066699
- a(n) = prime(n+1)^2 + prime(n)^2.at n=18A069484
- Number of one-element transitions among partitions of the integer n for labeled parts.at n=16A094533
- Expansion of 1/(1-x-x^2+x^3-x^4).at n=23A124280
- a(0) = 1, a(1) = 2; for n>0, a(2*n) = 3*a(2*n-1) - a(2*n-2), a(2*n+1) = 3*a(2*n) - a(2*n-1) - a(n-1).at n=10A129804
- Inverse permutation to A190132.at n=8A190133
- Number of 0..n arrays x(0..5) of 6 elements with zero 4th differences.at n=20A200084
- Number of nondecreasing -2..2 vectors of length n whose dot product with some nonincreasing -2..2 vector equals n.at n=23A226393
- Number of n X 2 0,1 arrays indicating 2 X 2 subblocks of some larger (n+1) X 3 binary array having determinant equal to one, with rows and columns of the latter in nondecreasing lexicographic order.at n=21A227637
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 182", based on the 5-celled von Neumann neighborhood.at n=28A270632
- Partial sums of A147562.at n=30A272928
- Products of distinct numbers in A052963.at n=36A274453
- 5-untouchable numbers.at n=19A284187
- Expansion of (theta_3(z)*theta_3(23z) + theta_2(z)*theta_2(23z))^5.at n=16A328093
- Indices of records in A348249.at n=32A348256