2077
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
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 2176
- Proper Divisor Sum (Aliquot Sum)
- 99
- 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
- 1980
- Möbius Function
- 1
- Radical
- 2077
- 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
- 63
- 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
- Number of odd integers <= 2^n of form x^2 + y^2.at n=13A000074
- Let p(n, s, x) be predicate that number of occurrences of s's in x >= 2*n - the length of the longest sequence of s's in x. Then a(n)=#{x in {0,1}* | x ends in 0 and p(n,0,x) and (there is no prefix y of x such that p(n,0,y) or p(n,1,y))}.at n=4A000530
- Numbers k such that (1,k) is "good".at n=28A000696
- Expansion of 1/((1-x)^2*(1-x^2)*(1-x^5)*(1-x^10)*(1-x^20)).at n=37A001305
- If a, b are in the sequence, so is ab+3.at n=48A009302
- Coordination sequence T4 for Zeolite Code TER.at n=31A016436
- Pseudoprimes to base 30.at n=21A020158
- Pseudoprimes to base 37.at n=37A020165
- Pseudoprimes to base 68.at n=34A020196
- Strong pseudoprimes to base 30.at n=8A020256
- Coordination sequence T3 for Zeolite Code IFR.at n=32A024984
- a(n) = n^2 + n + 7.at n=45A027692
- a(n) = n*(2*n+5).at n=31A033537
- Number of partitions of n with equal nonzero number of parts congruent to each of 0, 1 and 3 (mod 5).at n=48A035583
- Numbers k such that gcd(phi(k), k-1) = number of divisors of (k-1).at n=43A039768
- Numerators of continued fraction convergents to sqrt(478).at n=4A041912
- Numbers n such that string 3,5 occurs in the base 8 representation of n but not of n-1.at n=36A044216
- Numbers n such that string 5,7 occurs in the base 9 representation of n but not of n-1.at n=28A044303
- Numbers n such that string 7,7 occurs in the base 10 representation of n but not of n-1.at n=20A044409
- Numbers n such that string 3,5 occurs in the base 8 representation of n but not of n+1.at n=36A044597