7929
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 27
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 11466
- Proper Divisor Sum (Aliquot Sum)
- 3537
- 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
- 5280
- Möbius Function
- 0
- Radical
- 2643
- Omega Function (Ω)
- 3
- 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
- 145
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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
- Sum of logarithmic numbers.at n=8A002748
- Numbers k such that the continued fraction for sqrt(k) has period 92.at n=15A020431
- Numbers k such that k^2 + k + 1, k^3 + k + 1 and k^4 + k + 1 are all prime.at n=29A057683
- Numbers k such that sigma(sigma(k)-k) = phi(k).at n=9A074875
- Numbers k that divide the sum of the digits of (k!)^2.at n=20A108862
- Numbers n such that 17, n, n+1 are the sides of a Heron triangle, i.e., a triangle with integer sides and integer area.at n=13A145820
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 1, 0), (0, 1, 0), (1, 0, 1), (1, 1, -1)}.at n=7A150295
- A054525 * A156348 * [1,2,3,...].at n=41A156833
- Decimal value of the concatenation of first n odd numbers in binary.at n=4A164943
- a(n) = Sum_{k<=n} A000203(k)*(n-k+1), where A000203(m) is the sum of divisors of m.at n=29A175254
- Triangle defined by g.f.: Sum_{n>=0} (4*n)!/n!^4 * x^(2*n)*y^n/(1-x-x*y)^(4*n+1), read by rows.at n=46A183065
- G.f.: A(x) = (1 + 21*x + 3*x^2 - x^3)/(1-x)^5.at n=8A183066
- Number of n X 2 zero-sum -1..1 arrays with rows and columns lexicographically nondecreasing.at n=11A202027
- 18k^2-36k+9 interleaved with 18k^2-18k+9 for k>=0.at n=44A216852
- Numbers n such that n^1+n+1, n^2+n+1, n^3+n+1 and n^4+n+1 are all prime.at n=11A219117
- Number of nX4 0..2 arrays with exactly floor(nX4/2) elements unequal to at least one horizontal or vertical neighbor, with new values introduced in row major 0..2 order.at n=4A222427
- Number of nX5 0..2 arrays with exactly floor(nX5/2) elements unequal to at least one horizontal or vertical neighbor, with new values introduced in row major 0..2 order.at n=3A222428
- T(n,k)=Number of nXk 0..2 arrays with exactly floor(nXk/2) elements unequal to at least one horizontal or vertical neighbor, with new values introduced in row major 0..2 order.at n=31A222430
- T(n,k)=Number of nXk 0..2 arrays with exactly floor(nXk/2) elements unequal to at least one horizontal or vertical neighbor, with new values introduced in row major 0..2 order.at n=32A222430
- a(n) = Sum_{i=0..n} digsum_6(i)^4, where digsum_6(i) = A053827(i).at n=17A231675