2724
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 6384
- Proper Divisor Sum (Aliquot Sum)
- 3660
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 904
- Möbius Function
- 0
- Radical
- 1362
- Omega Function (Ω)
- 4
- 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
- 66
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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
- Expansion of 1 / ((1-x)^2*(1-x^2)*(1-x^3)*(1-x^4)).at n=30A002621
- Coordination sequence T2 for Zeolite Code BPH.at n=40A008056
- Coordination sequence T4 for Zeolite Code MEI.at n=38A008149
- Coordination sequence for diamond.at n=33A008253
- Number of performances of n fragments in Stockhausen problem.at n=3A008273
- Coordination sequence T1 for Zeolite Code -CHI.at n=33A009846
- Coordination sequence for CaF2(2), F position.at n=33A009925
- A thinks of x in set M; B asks questions: is x in T?; A may lie once but only when true answer is Yes; a(n) is maximal size of M such that B can determine x with <= n questions.at n=13A010033
- Expansion of 1/((1-x)*(1-2*x)*(1-x^2)).at n=10A011377
- Powers of fifth root of 3 rounded down.at n=36A018120
- Powers of fifth root of 3 rounded to nearest integer.at n=36A018121
- Powers of fifth root of 9 rounded down.at n=18A018138
- Powers of fifth root of 9 rounded to nearest integer.at n=18A018139
- Number of positive integers that are not the sum of distinct n-th-order polygonal numbers.at n=26A025524
- Sequence satisfies T^2(a)=a, where T is defined below.at n=48A027586
- Positions of records in A030757.at n=45A030762
- Limit of the position of the n-th partition into parts 5k+2 or 5k+3 in the list of all integer partitions sorted in reverse lexicographic order, for integers == 4 (mod 5).at n=39A035409
- Number of partitions of n with equal nonzero number of parts congruent to each of 0 and 2 (mod 3).at n=37A035538
- Number of partitions satisfying (cn(0,5) <= cn(2,5) and cn(0,5) <= cn(3,5) and cn(0,5) <= cn(1,5) and cn(0,5) <= cn(4,5)).at n=29A036801
- Number of partitions of n such that cn(0,5) = cn(2,5) < cn(3,5) = cn(4,5) <= cn(1,5).at n=52A036854