3634
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 5760
- Proper Divisor Sum (Aliquot Sum)
- 2126
- 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
- 1716
- Möbius Function
- -1
- Radical
- 3634
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 69
- 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
- Number of series-reduced connected labeled graphs with n nodes.at n=6A003515
- Coordination sequence T7 for Zeolite Code DDR.at n=38A008077
- Coordination sequence T2 for Zeolite Code STI.at n=41A008235
- Expansion of 1/((1-2x)*(1-7x)*(1-11x)).at n=3A016314
- Fibonacci sequence beginning 2, 24.at n=12A022374
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = A014306, t = (primes).at n=51A024696
- a(n) = dot_product(1,2,...,n)*(4,5,...,n,1,2,3).at n=19A026040
- Quotient of 'base-3' division described in A032537.at n=24A032538
- Number of partitions satisfying (cn(0,5) = 0 and cn(2,5) = cn(3,5)).at n=43A036815
- Schoenheim bound L_1(n,4,3).at n=41A036831
- Number of partitions of n such that cn(0,5) = cn(1,5) <= cn(2,5) = cn(4,5) <= cn(3,5).at n=59A036862
- Numbers k such that the string 7,7 occurs in the base 9 representation of k but not of k-1.at n=44A044321
- Coordination sequence T7 for Zeolite Code SFE.at n=40A057323
- Make an infinite chessboard from the squares in the first quadrant; sequence gives number of squares a knight can reach in n moves starting at the origin.at n=45A065450
- The (5^n)-th composite number.at n=5A065524
- a(n) = largest number m such that A024936(m) is n.at n=42A068308
- Number of basis partitions of n+100 with Durfee square size 10.at n=18A069253
- Positions of A080299 in A014486.at n=9A080298
- a(n) = {A089713(n)+A070219(n)}/2.at n=33A089715
- Least multiple of n such that every partial concatenation followed by a 7 is prime.at n=45A109744