7710
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 18576
- Proper Divisor Sum (Aliquot Sum)
- 10866
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 2048
- Möbius Function
- 1
- Radical
- 7710
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 4
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
- 52
- 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
- Number of primitive polynomials of degree n over GF(2) (version 2).at n=16A000020
- a(n) = floor(2^n / n).at n=16A000799
- Number of degree-n irreducible polynomials over GF(2); number of n-bead necklaces with beads of 2 colors when turning over is not allowed and with primitive period n; number of binary Lyndon words of length n.at n=17A001037
- Number of primitive polynomials of degree n over GF(2).at n=16A011260
- a(n) = s(1)s(n) + s(2)s(n-1) + ... + s(k)s(n-k+1), where k = floor( n/2 ), s = natural numbers >= 3.at n=39A024875
- a(n) = (d(n)-r(n))/5, where d = A026060 and r is the periodic sequence with fundamental period (0,0,1,4,0).at n=52A026062
- Sum{T(n-k,k)}, 0<=k<=[ n/2 ], T given by A026907.at n=11A026918
- Schoenheim bound L_1(n,n-4,n-5).at n=26A036830
- Base-4 digits are, in order, the first n terms of the periodic sequence with initial period 1,3,2,0.at n=6A037709
- Product_{k>=1}1/(1 - x^k)^a(k) = 1 + 2x.at n=16A038063
- Product_{k>=1} (1 + x^k)^a(k) = 1 + 2x.at n=16A038067
- A simple grammar: cycles of pairs of sequences.at n=17A052823
- a(n) = phi(2^prime(n) - 1)/prime(n); a(0) = 0 by convention.at n=7A056743
- Triangle T(n,k) of numbers of n degree irreducible polynomials over GF(2) which have order A059912(n,k), k=1..A059499(n).at n=59A059913
- a(n) = (1/n) * Sum_{ d divides n } mu(n/d) * (2^d - 1).at n=16A059966
- Number of orbits of length n in map whose periodic points are A000051.at n=16A060477
- Number of orbits of length n in map whose periodic points come from A059990.at n=16A060480
- Number of subsets of {1,2,..n} that sum to 1 mod n.at n=16A064355
- a(n) = (2^prime(n)-2)/prime(n); a(0) = 0 by convention.at n=7A064535
- a(n) = round( 2^n/n ).at n=16A065482