3567
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
- 8
- Divisor Sum
- 5040
- Proper Divisor Sum (Aliquot Sum)
- 1473
- 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
- 2240
- Möbius Function
- -1
- Radical
- 3567
- 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
- 193
- 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
- no
- Odd
- yes
Appears in sequences
- Expansion of x^3*(5-2*x)*(1-x^3)/(1-x)^4.at n=27A000338
- a(n) = round(n*phi^10), where phi is the golden ratio, A001622.at n=29A004945
- a(n) = ceiling(n*phi^10), where phi is the golden ratio, A001622.at n=29A004965
- Numbers k such that 10*3^k + 1 is prime.at n=20A005539
- Numbers k such that the geometric mean of phi(k) and sigma(k) is an integer.at n=40A011257
- Geometric mean of phi(n) and sigma(n) is an integer, n odd.at n=16A015705
- Expansion of 1/(1-x^3-x^4-x^5-x^6-x^7-x^8-x^9-x^10-x^11).at n=26A017824
- a(n+2) = 3*a(n) - a(n-2) with a(0) = 1, a(1) = 3, a(2) = 6.at n=13A018186
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly nine 1's.at n=7A020445
- Positive numbers k such that k and 2*k are anagrams in base 8 (written in base 8).at n=13A023073
- a(n) = position of 3*(n^2) in A000408.at n=37A024800
- Numbers whose base-4 representation has 4 fewer 0's than 3's.at n=35A031469
- a(n) = n*(2*n+5).at n=41A033537
- Multiplicity of highest weight (or singular) vectors associated with character chi_173 of Monster module.at n=38A034561
- Sums of 10 distinct powers of 2.at n=25A038461
- Numerators of continued fraction convergents to sqrt(631).at n=5A042210
- Numbers n such that string 6,7 occurs in the base 10 representation of n but not of n-1.at n=38A044399
- Numbers n such that string 6,7 occurs in the base 10 representation of n but not of n+1.at n=38A044780
- Numbers having, in base 15, (sum of even run lengths)=(sum of odd run lengths).at n=25A044886
- Numbers whose base-4 representation contains no 0's and exactly four 3's.at n=34A045065