2642
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 3966
- Proper Divisor Sum (Aliquot Sum)
- 1324
- 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
- 1320
- Möbius Function
- 1
- Radical
- 2642
- Omega Function (Ω)
- 2
- 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
- 102
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- Conjecturally largest even integer which is an unordered sum of two primes in exactly n ways.at n=29A000954
- Numbers k such that phi(k) = phi(k+2).at n=42A001494
- Number of partitions of floor(5n/2)-1 into n nonnegative integers each no more than 5.at n=24A001976
- a(n) = (5*n + 1)^2 + 4*n + 1.at n=10A007533
- Coordination sequence T2 for Zeolite Code AFR.at n=39A008020
- Coordination sequence T2 for Zeolite Code DDR.at n=32A008072
- Coordination sequence T2 for Zeolite Code MTW.at n=33A008197
- Coordination sequence T4 for Zeolite Code VET.at n=31A009905
- Numbers k such that the continued fraction for sqrt(k) has period 3.at n=12A013643
- Expansion of 1/(1-x^6-x^7-x^8-x^9-x^10).at n=48A017850
- Place where n-th 1 occurs in A023119.at n=44A022781
- Sum of distinct prime divisors of prime(n)*prime(n-1) - 1.at n=42A023521
- a(n) = least 2k such that p is the least prime in a Goldbach partition of 2k, where p = prime(n).at n=26A025017
- Numbers k such that least prime in the Goldbach partition of k increases.at n=9A025018
- Numbers whose least quadratic nonresidue (A020649) is 7.at n=37A025023
- Molien series for complete weight enumerator of self-dual code over GF(5).at n=25A028344
- Numbers with exactly five distinct base-7 digits.at n=34A031984
- a(0)=2; a(n) is the smallest k > a(n-1) such that the fractional part of k^(1/9) starts with n.at n=40A034074
- Multiplicity of highest weight (or singular) vectors associated with character chi_32 of Monster module.at n=37A034420
- Number of partitions satisfying (cn(2,5) = cn(3,5) and cn(0,5) <= cn(1,5) and cn(0,5) <= cn(4,5) and cn(2,5) <= cn(1,5) and cn(2,5) <= cn(4,5)).at n=40A036811