3672
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 32
- Divisor Sum
- 10800
- Proper Divisor Sum (Aliquot Sum)
- 7128
- 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
- 1152
- Möbius Function
- 0
- Radical
- 102
- Omega Function (Ω)
- 7
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 131
- 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
- Coordination sequence T1 for Zeolite Code BIK.at n=36A008047
- Coordination sequence T4 for Zeolite Code MOR.at n=39A008185
- If a, b in sequence, so is ab+8.at n=20A009331
- Magnetic susceptibility coefficients for square lattice spin 2 Ising model.at n=33A010116
- Magnetic susceptibility coefficients for square lattice spin 3 Ising model.at n=53A010117
- Magnetic susceptibility coefficients for square lattice spin 5/2 Ising model.at n=43A010119
- a(n) = floor(n(n-1)(n-2)(n-3)/20).at n=18A011930
- a(n) is the concatenation of n and 2n.at n=35A019550
- a(n) = T(n,1) + T(n-1,2) + ...+ T(n-k+1,k), where k = floor((n+1)/2) and T is the array defined in A026098.at n=26A026103
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 15.at n=26A031513
- a(n) = n*(n+1)*(5*n+1)/6.at n=15A033994
- Number of partitions of n with equal number of parts congruent to each of 0 and 3 (mod 5).at n=35A035554
- a(n) = prime(2^n) + 1.at n=9A051440
- Expansion of e.g.f. (1-x)/(1-4*x+x^2).at n=4A052677
- Triangular array T(n,k): start with T(n,0)=T(n,n)=1 for n >= 0; recursively, draw vertical lines through T(n-1,k-1) if present and T(n-1,k) if present; then T(n,k) is the sum of T(i,j) that lie on or between the lines and not below T(n,k).at n=59A054120
- Occurrences of most frequently occurring number in 1-to-n 4-dimensional multiplication table.at n=44A057341
- Occurrences of most frequently occurring number in 1-to-n 4-dimensional multiplication table.at n=46A057341
- Occurrences of most frequently occurring number in 1-to-n 4-dimensional multiplication table.at n=45A057341
- A014486-encodings of Catalan mountain ranges with no sea-level valleys, i.e., the rooted plane general trees with root degree = 1.at n=38A057547
- McKay-Thompson series of class 20b for Monster.at n=17A058557