7270
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 13104
- Proper Divisor Sum (Aliquot Sum)
- 5834
- 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
- 2904
- Möbius Function
- -1
- Radical
- 7270
- 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
- 70
- 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 coprime chains with largest member prime(n).at n=29A003140
- Positions of 4-digit terms in the continued fraction for Pi (3 is at position 0).at n=6A048959
- Numbers k such that reverse(k) is a prime factor of k.at n=43A072299
- Records of the coefficients of the continued fraction for the Product_{p prime} (1 - 2/p^2).at n=9A074178
- Numbers n such that numerator(Bernoulli(2*n)/(2*n)) is different from numerator(Bernoulli(2*n)/(2*n*(2*n+1))).at n=26A090177
- Expansion of g.f. (1-x-x^3+x^4-2*x^2)/((1-2*x)*(x-1)^2*(x+1)^2).at n=16A106157
- Start with 1 and repeatedly reverse the digits and add 61 to get the next term.at n=42A118156
- Number of circular n-letter words over the alphabet {0,1,2,3} with adjacent letters differing by at most 2.at n=7A124805
- Number of chromatically unique simple graphs on n nodes.at n=8A137568
- Number of formula representations of n using addition, multiplication, exponentiation and the constant 1.at n=9A214836
- Numbers k such that the period of Fibonacci numbers mod k is 3*(k+10).at n=33A229466
- Expansion of f(-x^5)^10 / f(-x)^2 in powers of x where f() is a Ramanujan theta function.at n=43A243938
- Numbers n such that the smallest prime divisor of n^2+1 is 61.at n=39A248549
- Number of length 2+2 0..n arrays with the medians of every three consecutive terms nondecreasing.at n=8A250141
- Number of (2+1)X(n+1) 0..1 arrays with every 2X2 subblock ne-sw antidiagonal difference unequal to its neighbors horizontally and nw+se diagonal sum unequal to its neighbors vertically.at n=8A253699
- Least m > 0 such that gcd(m^n+10, (m+1)^n+10) > 1, or 0 if there is no such m.at n=24A255860
- Expansion of Product_{k>=1} (1 - x^(10*k))/(1 - x^k).at n=32A261776
- Array read by antidiagonals: T(m,n) = number of m-ary words of length n with cyclically adjacent elements differing by 2 or less.at n=37A285280
- a(n) = Sum_{k=1..n} (A000330(n) mod k^2).at n=34A344711
- Numbers that are the sum of ten fourth powers in eight or more ways.at n=16A345601