9527
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 10896
- Proper Divisor Sum (Aliquot Sum)
- 1369
- 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
- 8160
- Möbius Function
- 1
- Radical
- 9527
- 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
- 197
- 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
- Crystal ball sequence for diamond.at n=22A007904
- Number of ordered quadruples of integers from [ 2,n ] with no common factors between triples.at n=23A015639
- Fibonacci sequence beginning 1, 15.at n=15A022105
- Numbers k such that Fib(k) == 13 (mod k).at n=42A023178
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (natural numbers), t = A000201 (lower Wythoff sequence).at n=39A024863
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 97.at n=12A031595
- Numerators of continued fraction convergents to sqrt(767).at n=9A042478
- Interprimes which are of the form s*prime, s=7.at n=11A075282
- Numerators of convergents of the continued fraction with the n+1 partial quotients: [1;1,1,...(n 1's)...,1,n+1], starting with [1], [1;2], [1;1,3], [1;1,1,4], ...at n=14A088209
- "Orders" where balanced prime number records (A082080) occur.at n=51A096692
- Number of partitions of n into parts each of which is used a different number of times.at n=47A098859
- Number of n X n binary arrays symmetric under 180 degree rotation with all ones connected only in a 1001-1111-1001 pattern in any orientation.at n=12A146932
- (Average of twin balanced prime pairs)/10.at n=35A173893
- G.f.: A(x) = x/Series_Reversion(x*G(x)) where G(x) = Sum_{n>=0} (n+1)^(n-1)*x^n.at n=6A180747
- Number of (w,x,y) with all terms in {0,...,n} and |w-x| + |x-y| + |y-w| < w+x+y.at n=23A213488
- Construct sequences P,Q,R by the rules: Q = first differences of P, R = second differences of P, P starts with 1,5,11, Q starts with 4,6, R starts with 2; at each stage the smallest number not yet present in P,Q,R is appended to R; every number appears exactly once in the union of P,Q,R. Sequence gives P.at n=33A225376
- Number of partitions p of n such that (number of numbers in p having multiplicity > 1) = number of 1s in p.at n=43A241090
- a(n) = n*(Lucas(n)*Lucas(n+1) - 2).at n=7A292360
- a(0) = 1; a(n) = Sum_{k=1..n} (-1)^(k+1)*d(k+1)*a(n-k), where d() is the number of divisors (A000005).at n=16A307241
- a(1) = a(2) = 1; for n > 2, a(n+2) = Sum_{d|n} tau(n/d)*a(d), where tau = number of divisors (A000005).at n=63A319133