3569
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
- 3696
- Proper Divisor Sum (Aliquot Sum)
- 127
- 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
- 3444
- Möbius Function
- 1
- Radical
- 3569
- 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
- 74
- 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
- Expansion of the reciprocal of the g.f. defining A039924.at n=15A003116
- a(n) = 3*n^2 + 3*n - 1.at n=34A004538
- a(n) = n*(2*n-3).at n=43A014107
- Expansion of (1+x^2)/(1-2*x+x^3).at n=15A014739
- a(n) = position of n^2 + (n+1)^2 + (n+2)^2 in A000408.at n=36A024802
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (F(2), F(3), F(4), ...), t = A014306.at n=31A025110
- a(n) = (2*n+1) * (4*n-1).at n=21A033566
- Number of partitions of n into parts not of the form 23k, 23k+5 or 23k-5. Also number of partitions with at most 4 parts of size 1 and differences between parts at distance 10 are greater than 1.at n=29A035993
- Numbers k such that k-th and (k+1)-st term of A038593 differ by 6.at n=25A038637
- Numbers n such that string 6,9 occurs in the base 10 representation of n but not of n-1.at n=38A044401
- Numbers n such that string 6,9 occurs in the base 10 representation of n but not of n+1.at n=38A044782
- Composite numbers n such that k! == 1 (mod n) for some k > 2.at n=13A049048
- Coordination sequence T1 for Zeolite Code SAV.at n=45A057314
- Coordination sequence T2 for Zeolite Code SAV.at n=45A057315
- Smallest semiprime p*q such that q >= p and q mod p = n.at n=40A064910
- Numbers n such that phi(phi(n)) = phi(sigma(n)) where phi is Euler's totient and sigma is the multiplicative sum-of-divisors function.at n=35A065555
- Expansion of Molien series for a certain 4-D group of order 48.at n=39A078411
- A087708/5.at n=63A087709
- A087708/5.at n=37A087709
- a(n) = 5^n *n! *L_n^{-1/5}(-1), where L_n^(alpha)(x) are generalized Laguerre polynomials.at n=3A089916