2167
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 2376
- Proper Divisor Sum (Aliquot Sum)
- 209
- 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
- 1960
- Möbius Function
- 1
- Radical
- 2167
- 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
- 138
- 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
- no
- Odd
- yes
Appears in sequences
- Numbers k such that (1,k) is "good".at n=31A000696
- Squares written in base 9.at n=39A002442
- Number of partitions of n that do not contain 1 as a part.at n=34A002865
- Number of partitions of n into Fibonacci parts (with 2 types of 1).at n=26A007000
- Shifts left 2 places under Stirling2 transform.at n=8A007469
- Coordination sequence T3 for Zeolite Code PAU.at n=34A008221
- Numbers n such that phi(n) * sigma(n) + 4 is a perfect square.at n=37A015727
- Expansion of 1/(1 - x^11 - x^12 - ...).at n=62A017905
- Numbers k such that the continued fraction for sqrt(k) has period 42.at n=15A020381
- a(n) = n*(9*n - 1)/2.at n=22A022266
- Expansion of Product_{m>=1} (1 + m*q^m)^11.at n=4A022639
- Dying rabbits: a(n) = a(n-1) + a(n-2) - a(n-8).at n=18A023438
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = A014306, t = (primes).at n=41A024696
- T(n,n-2), where T is the array in A026374.at n=43A026381
- a(n) = T(n,n-2), where T is the array in A026386.at n=43A026393
- a(n) = n^2 + n + 5.at n=46A027690
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 26 ones.at n=13A031794
- Coordination sequence T7 for Zeolite Code STT.at n=31A038419
- Numerators of continued fraction convergents to sqrt(813).at n=5A042568
- Numbers n such that string 6,7 occurs in the base 8 representation of n but not of n-1.at n=33A044242