7739
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 26
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 7920
- Proper Divisor Sum (Aliquot Sum)
- 181
- 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
- 7560
- Möbius Function
- 1
- Radical
- 7739
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 145
- 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
- Padovan sequence (or Padovan numbers): a(n) = a(n-2) + a(n-3) with a(0) = 1, a(1) = a(2) = 0.at n=38A000931
- For n = 0, 1, 2, a(n) = n; thereafter, a(n) = 2*a(n-1) - a(n-2) + a(n-3).at n=17A005314
- a(0) = 0, a(1) = 1, a(2) = 1; thereafter a(n) = 5*a(n-1) - 4*a(n-2) + a(n-3).at n=10A012855
- Pisot sequences E(5,9), P(5,9).at n=13A020713
- Pisot sequences E(7,9), P(7,9).at n=25A020720
- [ (4th elementary symmetric function of S(n))/(first elementary symmetric function of S(n)) ], where S(n) = {first n+3 odd positive integers}.at n=5A024203
- a(n) = (2*n - 1)*(3*n + 1).at n=36A033569
- Number of partitions of n into parts not of the form 15k, 15k+2 or 15k-2. Also number of partitions with 1 part of size 1 and differences between parts at distance 6 are greater than 1.at n=38A035956
- Numbers having four 5's in base 6.at n=14A043392
- Expansion of (1 - x)/(1 - 3*x + 2*x^2 - x^3).at n=11A052921
- a(1) = 1; a(n+1) = a(n) + (largest square <= a(n)).at n=15A060984
- Numbers n such that phi(2n-1) = sigma(n).at n=29A067230
- Numbers n such that sigma(n)=phi(n*bigomega(n)-1).at n=25A067877
- Numbers k such that sigma(k) = phi(k*omega(k)-1).at n=36A067878
- Nonprime numbers n such that q=phi(n)/(sigma(n)-n-1) is an integer and n is not a prime square.at n=42A070161
- Expansion of (1 - x)/(1 - x^2 - x^3).at n=40A078027
- Length of lists created by n substitutions k -> Range[0,1+Mod[k+1,3]] starting with {0}.at n=8A084084
- a(n) = 8*n^2 + 88*n + 43.at n=26A086760
- Number of n-th generation triangles in the tiling of the hyperbolic plane by triangles with angles {Pi/2, Pi/3, 0}.at n=28A096231
- Number of partitions of n into parts congruent to {0, 1, 3, 5} mod 6.at n=48A096981