7274
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 10914
- Proper Divisor Sum (Aliquot Sum)
- 3640
- 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
- 3636
- Möbius Function
- 1
- Radical
- 7274
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 18
- 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
- yes
- Odd
- no
Appears in sequences
- Expansion of 1/((1+x)(1-x)^8).at n=9A001779
- Numbers that are the sum of 3 positive 5th powers.at n=33A003348
- Oscillates under partition transform.at n=51A007213
- Numbers k such that the continued fraction for sqrt(k) has period 43.at n=18A020382
- Numbers k such that the continued fraction for sqrt(k) has odd period and if the last term of the periodic part is deleted the two central terms are both 24.at n=1A031612
- Number of partitions of n such that cn(0,5) = cn(2,5) <= cn(3,5) = cn(4,5) <= cn(1,5).at n=56A036846
- n*10^3-1, n*10^3-3, n*10^3-7 and n*10^3-9 are all prime.at n=5A064977
- Let p(k) denote k-th prime; consider solutions (n,m) of the Diophantine system {p(p(n)+1)-p(p(n))=2, p(p(n))-6.p(p(m))=-1} (*); sequence gives values of m.at n=27A065511
- Coefficient of x^n in 1/((1+x)*(1-x)^(n-1)).at n=9A091526
- Triangle read by rows: T(n,k) is the number of Motzkin paths of length n having k ascents (0<=k<=floor(n/2)); an ascent is a maximal string of upsteps.at n=45A114580
- (Sum of the squares of the quadratic nonresidues of prime(n)) / prime(n).at n=39A125618
- a(n) = floor(Fibonacci(n)/n).at n=26A127884
- Padovan-like sequence; a(0)=2, a(1)=1, a(2)=1, a(n) = a(n-2) + a(n-3).at n=32A141038
- G.f. satisfies: A(x) = x*(1 + A(A(x)))/(1 - A(A(x))).at n=5A141149
- 1/12 of the number of permutations of 3 indistinguishable copies of 1..n with exactly 5 local maxima.at n=3A152502
- The number of sigma-admissible subsets of {1,2,...,n} as defined by Marzuola-Miller.at n=22A158449
- Partial sums of floor(2^n/9).at n=15A178742
- Number of (n+2) X 3 binary arrays with every 3 X 3 subblock commuting with each horizontal and vertical neighbor 3 X 3 subblock.at n=12A190025
- G.f. satisfies A(x) = exp( Sum_{n>=1} (A(x^n) + A(-x^n))/2 * x^n/n ).at n=20A195865
- Number of nXnXn 0..6 triangular arrays with each element x equal to the number its neighbors equal to 3,3,2,2,0,2,0 for x=0,1,2,3,4,5,6.at n=5A207157