5655
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
- 10080
- Proper Divisor Sum (Aliquot Sum)
- 4425
- 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
- 2688
- Möbius Function
- 1
- Radical
- 5655
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 111
- 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
- Fibonacci numbers written in base 9.at n=19A004692
- Coordination sequence T1 for Coesite.at n=40A008267
- Orders of cyclotomic polynomials containing a coefficient the absolute value of which is >= 5.at n=22A013593
- Fibonacci sequence beginning 0, 15.at n=14A022349
- Numerator of n*(n-2)*(2*n-1)/(2*(n-1)).at n=13A022997
- Number of distinct products ijk with 0 <= i,j,k <= n.at n=45A027426
- Numbers having period-4 6-digitized sequences.at n=32A031197
- Least term in period of continued fraction for sqrt(n) is 5.at n=25A031429
- Numbers whose set of base-12 digits is {2,3}.at n=29A032812
- Numbers whose set of base-12 digits is {3,4}.at n=14A032836
- Numbers whose set of base-12 digits is {1,3}.at n=29A032919
- a(n) = (3*n - 1)*(4*n - 1).at n=22A033578
- Number of partitions satisfying cn(1,5) <= cn(0,5) + cn(2,5) + cn(3,5) and cn(4,5) <= cn(0,5) + cn(2,5) + cn(3,5).at n=32A039870
- Numbers having three 5's in base 10.at n=28A043511
- Positive integers having more base-12 runs of even length than odd.at n=38A044838
- Squarefree odd numbers with exactly 4 distinct prime factors.at n=29A046390
- a(n) in base 12 is a repdigit.at n=36A048336
- Numbers n such that the Diophantine equation x^4+y^5=n^4 has solutions.at n=16A070756
- Schroeder pseudoprimes: Composites k that divide the k-th Schroeder number A001003(k-1).at n=14A075764
- 2-apexes of omega: numbers k such that omega(k-2) < omega(k-1) < omega(k) > omega(k+1) > omega(k+2), where omega(m) = the number of distinct prime factors of m.at n=28A076762