7051
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 7704
- Proper Divisor Sum (Aliquot Sum)
- 653
- 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
- 6400
- Möbius Function
- 1
- Radical
- 7051
- 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
- 57
- Smith Number
- yes
- 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
- Expansion of e.g.f. tanh(arctan(x) * exp(x)).at n=7A012415
- Expansion of g.f. x/(1 - 9*x - 2*x^2).at n=5A015579
- Positive integers n such that 2^n == 2^11 (mod n).at n=68A015935
- Pseudoprimes to base 79.at n=30A020207
- Strong pseudoprimes to base 79.at n=11A020305
- Digit sum of 'odd' number equals digit sum of 'sum' and 'juxtaposition' of its prime factors (counted with multiplicity).at n=35A036927
- a(n)=(s(n)+3)/10, where s(n)=n-th base 10 palindrome that starts with 7.at n=27A043086
- Expansion of 1/sqrt(1-2x-59x^2).at n=5A098440
- Number of partitions of n with at most 2 odd parts.at n=42A100835
- Number of partitions of n with at most 3 odd parts.at n=42A114312
- Number of base 21 circular n-digit numbers with adjacent digits differing by 2 or less.at n=5A124949
- (Sum of the squares of the quadratic residues of prime(n)) / prime(n).at n=43A125614
- "Self-Fibonacci"; a(n) is the sum of the last nine terms. Sequence starts with 6,9,2,15,14,1,3,3,9 which are f,i,b,o,n,a,c,c,i if you consider a=1, b=2, c=3, ..., z=26.at n=16A129938
- 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, -1, 0)}.at n=8A148985
- Partial sums of A151789.at n=48A151790
- Rectified 5-cell numbers: the coefficient of x^{2n-2} in (1+x+x^2+ ... + x^{n-1})^5.at n=11A179095
- Number of zero-sum -2..2 arrays of n elements with first through fourth differences also in -2..2.at n=16A201433
- Number of compositions c of n such that no three points (i,c_i), (j,c_j), (k,c_k) are collinear, where c_i denotes the i-th part.at n=19A238686
- Sum of the two smallest parts from the partitions of 4n into 4 parts with smallest part = 1.at n=21A239059
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 145", based on the 5-celled von Neumann neighborhood.at n=21A270288