6735
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
- 10800
- Proper Divisor Sum (Aliquot Sum)
- 4065
- 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
- 3584
- Möbius Function
- -1
- Radical
- 6735
- 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
- 88
- 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
- Number of bipartite partitions.at n=15A002762
- Stella octangula numbers: a(n) = n*(2*n^2 - 1).at n=15A007588
- a(n) = n*(15*n - 1)/2.at n=30A022272
- Positive numbers having the same set of digits in base 4 and base 9.at n=34A037427
- Denominators of continued fraction convergents to sqrt(911).at n=6A042761
- a(n) = Sum_{i=0..floor(n/2)} T(2i,n-2i), array T as in A048149.at n=28A049714
- Numbers k such that k | sigma_7(k).at n=34A055711
- Let R(i,j) be the rectangle with antidiagonals 1; 2,3; 4,5,6; ...; each k is an R(i(k),j(k)) and A057041(n)=j(F(n)), where F(n) is the n-th Fibonacci number.at n=37A057041
- Numbers k such that binomial(2k,k)+1 is prime.at n=29A066699
- Interprimes which are of the form s*prime, s=15.at n=29A075290
- Indices of primes of the form k^2 - 11.at n=34A091273
- Diagonal sums of correlation triangle for (1+x)^3/(1-x).at n=37A115294
- Nonprimes n such that 5^n==5 (mod n).at n=28A122782
- Let S(1)={1} and, for n>1 let S(n) be the smallest set containing x, x+1, 2x and 3x for each element x in S(n-1). a(n) is the number of elements in S(n).at n=12A123247
- Number of n X n binary arrays with all ones connected only in a 1100-1111-0011 pattern in any orientation.at n=7A147460
- Number of n X n binary arrays symmetric under horizontal and vertical reflection with all ones connected only in a 1100-1111-0011 pattern in any orientation.at n=17A147462
- Number of n X n binary arrays symmetric under horizontal and vertical reflection with all ones connected only in a 1100-1111-0011 pattern in any orientation.at n=16A147462
- Terms of A122782 which are not Carmichael numbers A002997.at n=22A153515
- Numbers of the form p*q*r, where p < q < r are odd primes such that r = +/-1 (mod p*q).at n=39A160353
- Triangle read by rows:t(n,m)=Sum[StirlingS2[n, k]*Eulerian[n - k + 1, m]*(-1)^(n - k - m)*k!, {k, 0, n}].at n=23A174553