9534
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 21888
- Proper Divisor Sum (Aliquot Sum)
- 12354
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 2712
- Möbius Function
- 1
- Radical
- 9534
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 4
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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 104
- 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
- Cycle class sequence c(n) (the number of true cycles of length n in which a certain node is included) for zeolite MTT = ZSM-23 Nan[AlnSi24-nO48] starting with a T1 atom.at n=12A019186
- Staircase of coefficients of polynomials used for column g.f.s of triangle A060924.at n=40A061187
- Square of lower triangular matrix of A056857 (successive equalities in set partitions of n).at n=30A078937
- Numbers k such that 10^k + 7*R_k is prime, where R_k = 11...1 is the repunit (A002275) of length k.at n=16A089147
- Sum of smallest parts of all partitions of n into distinct parts.at n=50A092265
- Numbers k such that the k-th triangular number contains only digits {3,4,5}.at n=8A119183
- Let P be Pascal's triangle A007318 and let N be Narayana's triangle A001263, both regarded as lower triangular matrices. Sequence gives triangle obtained from P*N, read by rows.at n=40A126182
- Ramanujan numbers (A000594) read mod 16384.at n=36A126824
- Triangle read by rows: T(n,k) is the number of skew Dyck paths of semilength n and having k UU's (doublerises) (n >= 1; 0 <= k <= n-1).at n=40A128718
- Third column of PE^2.at n=7A129324
- Triangle P, read by rows, where column k of P^3 equals column 0 of P^(3k+3) such that column 0 of P^3 equals column 0 of P shift one row up, with P(0,0)=1.at n=22A136220
- Column 1 of triangle A136220; also equals column 0 of U^2 = A136233 where U = A136228.at n=5A136222
- Matrix square of triangle U = A136228, read by rows.at n=15A136233
- Triangle T(n, k) = binomial(n+1, k)*A142458(n+1, k+1)/(k+1), read by rows.at n=22A155491
- Triangle T(n, k) = binomial(n+1, k)*A142458(n+1, k+1)/(k+1), read by rows.at n=26A155491
- a(n) = 343*n - 70.at n=27A157374
- G.f. satisfies: A( x*A(-x)/A(x) ) = 1 + x.at n=7A196497
- Smallest k such that q=2*k*prime(n)^4+b , r=2*k*q^4+c , s=2*k*r^4+d and q, r and s are all prime numbers with b, c and d = -1 or 1.at n=31A225056
- Numbers k such that the number of divisors of k+2 divides k and the number of divisors of k divides k+2.at n=48A268037
- Numbers n such that Bernoulli number B_{n} has denominator 1806.at n=17A272139