2718
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
- 2
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 5928
- Proper Divisor Sum (Aliquot Sum)
- 3210
- 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
- 900
- Möbius Function
- 0
- Radical
- 906
- Omega Function (Ω)
- 4
- 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
- 66
- 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 feldspar.at n=35A008254
- Decimal expansion of e truncated to n places.at n=3A011543
- Decimal expansion of e rounded to n places.at n=3A011544
- (s(n)+s(n+1))/6, where s()=A006521.at n=12A016059
- (s(n)+s(n+1))/18, where s()=A006521.at n=15A016060
- Expansion of 1/((1-x)*(1-2*x)*(1-4*x)*(1-11*x)).at n=3A021094
- Number of proper factorizations of p1^n*p2^3, where p1 and p2 are distinct primes.at n=13A031126
- Numbers whose set of base-13 digits is {1,3}.at n=18A032920
- Coordination sequence T1 for Zeolite Code SBE.at n=42A033604
- Number of partitions of n into parts not of the form 25k, 25k+2 or 25k-2. Also number of partitions with 1 part of size 1 and differences between parts at distance 11 are greater than 1.at n=31A036001
- Number of partitions of n into parts not of form 4k+2, 24k, 24k+11 or 24k-11. Also number of partitions in which no odd part is repeated, with at most 5 parts of size less than or equal to 2 and where differences between parts at distance 5 are greater than 1 when the smallest part is odd and greater than 2 when the smallest part is even.at n=37A036034
- Numbers congruent to 2,3,6,11 mod 12 missing from A042944 (conjectured to be finite).at n=17A042945
- Numbers n such that string 5,0 occurs in the base 9 representation of n but not of n-1.at n=37A044296
- Numbers k such that the string 6,5 occurs in the base 9 representation of k but not of k-1.at n=36A044310
- Numbers n such that string 1,8 occurs in the base 10 representation of n but not of n-1.at n=30A044350
- Numbers n such that string 5,0 occurs in the base 9 representation of n but not of n+1.at n=37A044677
- Numbers n such that string 1,8 occurs in the base 10 representation of n but not of n+1.at n=30A044731
- Numbers whose base-4 representation contains no 0's and exactly four 2's.at n=38A045041
- Numbers whose base-4 representation contains exactly four 2's and one 3.at n=27A045154
- Let N(k) and D(k) be the sequences defined in A054765 and A012244; write N(k)* D(k+j ) - N(k+j)*D(k) = (-1)^(k+1)*(k!)^2*P(k) where P(k) is a polynomial in k of degree j-1; sequence gives coefficients of expansion of P(k) in powers of k for j=1,2,3,...at n=13A054798