2672
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 10
- Divisor Sum
- 5208
- Proper Divisor Sum (Aliquot Sum)
- 2536
- 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
- 1328
- Möbius Function
- 0
- Radical
- 334
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 2
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
- 71
- 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
- Number of n-step self-avoiding walks on f.c.c. lattice ending at point with x = 1.at n=3A000766
- Conjecturally largest even integer which is an unordered sum of two primes in exactly n ways.at n=28A000954
- Almost trivalent maps.at n=2A002007
- Number of n-celled polygons with perimeter 2n on square lattice.at n=5A006726
- Number of homogeneous primitive partition identities of degree 6 with largest part n.at n=10A007344
- From random walks on complete directed triangle.at n=15A007829
- Coordination sequence T2 for Zeolite Code NAT.at n=35A008204
- Triangle T(n,k), n>=1, read by rows, where T(n,k) is the number of lattice polygons with area n and perimeter 2*k.at n=20A008855
- Number of partitions of n into distinct parts, none being 3.at n=52A015745
- Numbers k such that sigma(k) = sigma(k+12).at n=24A015882
- a(n) = a(n-1) + a(n-2) + 1, with a(0)=3, a(1)=8.at n=13A022407
- s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = A023532, t = (primes).at n=45A025077
- a(n) = A026637(2*n, n-2).at n=5A026640
- a(n) = 3*n^2 - 7*n + 6.at n=31A027599
- a(n) = floor(10000/sqrt(n)).at n=13A033433
- a(n)=number of Gaussian integers z=a+bi satisfying |z|<=n, b>=0.at n=41A036695
- Number of partitions satisfying (cn(1,5) = cn(4,5) and cn(0,5) <= cn(2,5) and cn(0,5) <= cn(3,5)).at n=41A036810
- Number of partitions satisfying cn(0,5) + cn(1,5) <= 1 and cn(0,5) + cn(4,5) <= 1.at n=42A039850
- Number of partitions satisfying cn(1,5) <= cn(0,5) + cn(2,5) and cn(1,5) <= cn(0,5) + cn(3,5) and cn(4,5) <= cn(0,5) + cn(2,5) and cn(4,5) <= cn(0,5) + cn(3,5).at n=32A039874
- Numbers k such that the string 8,8 occurs in the base 9 representation of k but not of k-1.at n=32A044331