2632
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 5760
- Proper Divisor Sum (Aliquot Sum)
- 3128
- 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
- 1104
- Möbius Function
- 0
- Radical
- 658
- Omega Function (Ω)
- 5
- 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
- 53
- 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
- Tribonacci numbers: a(n) = a(n-1) + a(n-2) + a(n-3) with a(0)=0, a(1)=1, a(2)=0.at n=16A001590
- "Magic" integers: a(n+1) is the smallest integer m such that there is no overlap between the sets {m, m-a(i), m+a(i): 1 <= i <= n} and {a(i), a(i)-a(j), a(i)+a(j): 1 <= j < i <= n}.at n=31A004210
- Difference between the number of 7-dimensional partitions of n and an approximation derived from binomial(n,6).at n=7A007330
- Coordination sequence T1 for Zeolite Code LOV.at n=34A008134
- Coordination sequence T5 for Zeolite Code RSN.at n=33A009889
- Coordination sequence T2 for Zeolite Code RTE.at n=35A009891
- Coordination sequence for net formed by holes in D_4 lattice.at n=6A010079
- Numbers with exactly 6 1's in their ternary expansion.at n=24A023697
- (d(n)-r(n))/5, where d = A008778 and r is the periodic sequence with fundamental period (0,3,1,0,1).at n=39A026053
- a(n) = n*(n + 9).at n=47A028569
- Number of words of length 4 in the n(n-1)/2 transpositions of S[ n ] equivalent to the identity.at n=7A029699
- Least term in period of continued fraction for sqrt(n) is 3.at n=39A031427
- Number of rooted compound windmills (mobiles) of n nodes.at n=10A032200
- Numbers k such that 37*2^k+1 is prime.at n=24A032368
- Concatenation of n and n + 6 or {n,n+6}.at n=25A032611
- Fractional part of square root of a(n) starts with 3: first term of runs.at n=48A034109
- Multiplicity of highest weight (or singular) vectors associated with character chi_141 of Monster module.at n=37A034529
- Consider the sequence of 4-tuples {0,a,b,c} (c>=a+b; a,b,c>0) which have the smallest integer 'c' required to reach {k,k,k,k} in n steps under map {r,s,t,u}->{|r-s|,|s-t|,|t-u|,|u-r|}. This sequence gives the second term 'a' of these quadruples.at n=25A034803
- Consider the sequence of 4-tuples {0,a,b,c} (c>=a+b; a,b,c>0) which have the smallest integer 'c' required to reach {k,k,k,k} in n steps under map {r,s,t,u}->{|r-s|,|s-t|,|t-u|,|u-r|}. This sequence gives the third term 'b' of these quadruples.at n=23A034804
- Number of partitions satisfying (cn(0,5) = 0 and cn(2,5) <= cn(1,5) and cn(3,5) <= cn(1,5) and cn(2,5) <= cn(4,5) and cn(3,5) <= cn(4,5)).at n=38A036806