2710
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 10
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 4896
- Proper Divisor Sum (Aliquot Sum)
- 2186
- 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
- 1080
- Möbius Function
- -1
- Radical
- 2710
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 115
- 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
- a(n) is the number of partitions of 4n that can be obtained by adding together four (not necessarily distinct) partitions of n.at n=7A002221
- Centered triangular numbers: a(n) = 3*n*(n-1)/2 + 1.at n=42A005448
- Hexagonal prism numbers: a(n) = (n + 1)*(3*n^2 + 3*n + 1).at n=9A005915
- Coordination sequence T1 for Zeolite Code PAU.at n=38A008219
- Expansion of (1+x^4)/((1-x)*(1-x^2)*(1-x^3)*(1-x^4)).at n=55A008765
- arctanh(arctanh(x)*exp(x))=x+2/2!*x^2+7/3!*x^3+36/4!*x^4+293/5!*x^5...at n=6A012717
- A015938(n)-2^n.at n=45A015939
- Number of crossing set partitions of {1,2,...,n}.at n=8A016098
- Coordination sequence T1 for Zeolite Code CGF.at n=36A019451
- Coordination sequence T3 for Zeolite Code CZP.at n=34A019458
- Numbers k such that the continued fraction for sqrt(k) has period 32.at n=39A020371
- Numbers k such that Fibonacci(k) == 55 (mod k).at n=39A023181
- Theta series of A2[hole]^4.at n=18A033690
- Schoenheim bound L_1(n,n-4,n-5).at n=19A036830
- Numbers whose base-2 representation has exactly 10 runs.at n=30A043577
- a(n) = (s(n)-1)/2, where s(n) is the n-th number whose base-2 representation has exactly 11 runs.at n=34A043691
- Numbers n such that number of runs in the base 2 representation of n is congruent to 0 mod 10.at n=30A043763
- Numbers n such that string 4,1 occurs in the base 9 representation of n but not of n-1.at n=37A044288
- Numbers k such that the string 1,0 occurs in the base 10 representation of k but not of k-1.at n=26A044342
- Numbers n such that string 7,1 occurs in the base 10 representation of n but not of n-1.at n=29A044403