3642
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
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 7296
- Proper Divisor Sum (Aliquot Sum)
- 3654
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 1212
- Möbius Function
- -1
- Radical
- 3642
- 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
- 43
- 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 topologies on n labeled points satisfying the T_4 axiom.at n=5A006056
- Number of (x -> x^2)-free subsets of symmetric group.at n=6A007234
- Coordination sequence T1 for Zeolite Code APD.at n=40A008034
- Coordination sequence T4 for Zeolite Code STI.at n=41A008237
- Coordination sequence T2 for Zeolite Code YUG.at n=39A008248
- Coordination sequence T2 for Cordierite.at n=36A008252
- Coordination sequence T5 for Zeolite Code DFO.at n=46A009879
- Coordination sequence T6 for Zeolite Code DFO.at n=46A009880
- Numbers k such that Fibonacci(k) == -8 (mod k).at n=38A023166
- Sequence satisfies T^2(a)=a, where T is defined below.at n=51A027587
- a(n) = 3*n^2 - 7*n + 6.at n=36A027599
- Concatenation of n and n + 6 or {n,n+6}.at n=35A032611
- Number of partitions of n into parts not of form 4k+2, 20k, 20k+3 or 20k-3. Also number of partitions in which no odd part is repeated, with 1 part of size less than or equal to 2 and where differences between parts at distance 4 are greater than 1 when the smallest part is odd and greater than 2 when the smallest part is even.at n=45A036025
- Number of partitions satisfying cn(0,5) + cn(2,5) + cn(3,5) <= 1.at n=44A039853
- Denominators of continued fraction convergents to sqrt(376).at n=10A041713
- Internal digits of n^2 include digits of n, n does not end in 0.at n=39A046833
- Discriminants of real quadratic fields with class number 2 and related continued fraction period length of 18.at n=37A051983
- Let Py(n)=A000330(n)=n-th square pyramidal number. Consider all integer triples (i,j,k), j >= k>0, with Py(i)=Py(j)+Py(k), ordered by increasing i; sequence gives j values.at n=28A053720
- Number of connected bipartite graphs with n edges, no isolated vertices and a distinguished bipartite block, up to isomorphism.at n=10A056156
- Numbers n such that n | 11^n + 10^n + 1.at n=10A057294