2810
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 11
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 5076
- Proper Divisor Sum (Aliquot Sum)
- 2266
- 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
- 1120
- Möbius Function
- -1
- Radical
- 2810
- Omega Function (Ω)
- 3
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 84
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- Related to Gilbreath conjecture.at n=19A001549
- Coordination sequence T3 for Zeolite Code AFO.at n=35A008017
- Expansion of Jacobi theta constant theta_2^6 /(64q^(3/2)).at n=39A008440
- Numbers k such that k | 7^k + 1.at n=6A015954
- Expansion of 1/((1-2*x)*(1-5*x)*(1-11*x)).at n=3A016301
- Expansion of 1/((1-x)(1-3x)(1-5x)(1-10x)).at n=3A021464
- Numbers k such that Fibonacci(k) == 55 (mod k).at n=41A023181
- a(n) = [ (3rd elementary symmetric function of P(n))/(first elementary symmetric function of P(n)) ], where P(n) = {1, p(1), p(2), ..., p(n-1)}, where p(0) = 1.at n=9A024532
- Number of 3-balanced strings of length n: let d(S)= #(1)'s in S - #(0)'s, then S is k-balanced if every substring T has -k<=d(T)<=k; here k=3.at n=14A027557
- a(n+1) = Sum_{k=0..floor(3*n/4)} a(k) * a(n-k).at n=12A030035
- Every run of digits of n in base 4 has length 2.at n=29A033002
- Coordination sequence T7 for Zeolite Code SFF.at n=35A038431
- Numbers whose concatenation of prime factors (with multiplicity) is a square.at n=12A038693
- Base-4 palindromes that start with 2.at n=37A043004
- Numbers k such that the string 6,2 occurs in the base 9 representation of k but not of k-1.at n=38A044307
- Numbers k such that the string 1,0 occurs in the base 10 representation of k but not of k-1.at n=27A044342
- Numbers n such that string 8,1 occurs in the base 10 representation of n but not of n-1.at n=30A044413
- Numbers n such that string 6,2 occurs in the base 9 representation of n but not of n+1.at n=38A044688
- Numbers n such that string 1,0 occurs in the base 10 representation of n but not of n+1.at n=27A044723
- Numbers whose base-4 representation contains exactly four 2's and two 3's.at n=5A045155