2889
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 27
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 4320
- Proper Divisor Sum (Aliquot Sum)
- 1431
- 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
- 1908
- Möbius Function
- 0
- Radical
- 321
- Omega Function (Ω)
- 4
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 141
- 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
- no
- Odd
- yes
Appears in sequences
- Numerators of continued fraction convergents to sqrt(5).at n=6A001077
- Expansion of (1+x^2)(1+x^4)/((1-x)^2*(1-x^2)*(1-x^3)).at n=29A007979
- Coordination sequence T1 for Zeolite Code ACO, ASV, EDI, and THO.at n=38A008084
- Coordination sequence T2 for Zeolite Code THO.at n=38A008239
- Coordination sequence T1 for Zeolite Code -CHI.at n=34A009846
- Coordination sequence T3 for Zeolite Code SAO.at n=42A019573
- Expansion of Product_{m>=1} 1/(1 + m*q^m)^9.at n=8A022701
- a(n) = 18*a(n-1) - a(n-2).at n=3A023039
- Numbers k such that Fibonacci(k) == 34 (mod k).at n=26A023180
- a(n) is the smallest number that is the sum of 3 nonzero squares in exactly n ways.at n=21A025414
- Every run of digits of n in base 8 has length 2.at n=36A033006
- Duplicate of A008084.at n=38A033598
- Number of zeros in numbers 1 to 999..9 (n digits).at n=3A033713
- a(n) = n*(4*n-1).at n=27A033991
- Number of partitions of n into parts not of the form 21k, 21k+5 or 21k-5. Also number of partitions with at most 4 parts of size 1 and differences between parts at distance 9 are greater than 1.at n=28A035983
- Numerators of continued fraction convergents to sqrt(20).at n=5A041030
- Numerators of continued fraction convergents to sqrt(80).at n=5A041142
- Numbers n such that string 8,6 occurs in the base 9 representation of n but not of n-1.at n=38A044329
- Numbers n such that string 8,9 occurs in the base 10 representation of n but not of n-1.at n=28A044421
- Numbers k such that string 8,8 occurs in the base 10 representation of k but not of k+1.at n=28A044801