7298
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
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 11340
- Proper Divisor Sum (Aliquot Sum)
- 4042
- 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
- 3520
- Möbius Function
- -1
- Radical
- 7298
- 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
- 44
- 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) = (9*n+1)*(9*n+8).at n=9A001534
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 84.at n=19A031582
- a(n) = prime(n)*prime(n+1) - prime(n+1).at n=22A037167
- Number of partitions satisfying cn(2,5) + cn(3,5) <= cn(0,5) + cn(1,5) + cn(4,5).at n=32A039867
- a(n) = floor(Pi^n mod n^Pi).at n=29A066434
- Number of hexagonal regions in regular n-gon with all diagonals drawn.at n=35A067153
- Triangle of coefficients of polynomials P(n; x) = Permanent(M), where M=[m(i,j)] is n X n matrix defined by m(i,j)=x if -1<=i-j<=1 else m(i,j)=1.at n=40A080018
- a(n) = denominator of the continued fraction which has the positive divisors of n as its terms. The terms are written in order from 1 for the integer part, to n for the final term of the continued fraction.at n=17A127612
- Numbers n such that the sum of the proper divisors of n and n+1 equals either n or n+1.at n=16A130776
- Number of digits in A116534(n).at n=41A131059
- 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, 0, 1), (-1, 1, 1), (0, -1, 1), (0, 1, 1), (1, 0, -1)}.at n=8A148993
- a(n) = 49*n^2 - 78*n + 31.at n=12A157368
- Number of strictly increasing arrangements of 4 nonzero numbers in -(n+2)..(n+2) with sum zero.at n=31A188123
- Coefficients of expansion of "leading root" xi_0(y) of the partial theta function Sum_{n=0..oo} x^n y^{n(n-1)/2}.at n=11A195980
- a(1)=-1, a(2)=2, thereafter a(n) = (1/(2n))*((7n-22)a(n-1)+2(2n-1)a(n-2)).at n=13A210685
- A213784/12.at n=15A213789
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 94", based on the 5-celled von Neumann neighborhood.at n=28A270135
- Number of nX3 0..1 arrays with no 1 equal to more than two of its horizontal, diagonal and antidiagonal neighbors, with the exception of exactly two elements.at n=4A283779
- T(n,k)=Number of nXk 0..1 arrays with no 1 equal to more than two of its horizontal, diagonal and antidiagonal neighbors, with the exception of exactly two elements.at n=25A283784
- Number of 5Xn 0..1 arrays with no 1 equal to more than two of its horizontal, diagonal and antidiagonal neighbors, with the exception of exactly two elements.at n=2A283788