7050
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 17856
- Proper Divisor Sum (Aliquot Sum)
- 10806
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 1840
- Möbius Function
- 0
- Radical
- 1410
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 4
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
- 119
- 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
- yes
- Odd
- no
Appears in sequences
- Generalized divisor function. Number of partitions of n with exactly three part sizes.at n=47A002134
- Numbers k such that 15*2^k + 1 is prime.at n=28A002258
- Generalized Catalan numbers: a(n+1) = a(n) + Sum_{k=2..n-1} a(k)*a(n-1-k).at n=15A004149
- Expansion of 1/(1-x^7-x^8-x^9-x^10-x^11-x^12-x^13-x^14-x^15-x^16-x^17).at n=51A017866
- Number of partitions of n into parts not of the form 25k, 25k+10 or 25k-10. Also number of partitions with at most 9 parts of size 1 and differences between parts at distance 11 are greater than 1.at n=31A036009
- Internal digits of n^2 include digits of n as subsequence.at n=26A046834
- Numbers n such that 3*10^n - 1 is prime.at n=12A056703
- Square array T(k,n) by antidiagonals, where T(k,n) is number of ways of placing n identifiable nonnegative intervals with a total of exactly k starting and/or finishing points.at n=41A059515
- The sequence A059515(3,n). Number of ways of placing n identifiable nonnegative intervals with a total of exactly three starting and/or finishing points.at n=5A059517
- Number of partitions of n into odious numbers (A000069).at n=50A067590
- Sum of squares of digits of n is equal to the largest prime factor of n reversed, where the largest prime factor is not a palindrome.at n=11A074303
- Numerators of the convergents of the continued fraction for log(2).at n=13A079942
- Subdiagonal of array of n-gonal numbers A081422.at n=19A081423
- Triangle of T(n,k)=number of peakless Motzkin paths of length n containing k valleys (can be easily expressed using RNA secondary structure terminology).at n=29A089738
- Binomial (Binomial (n,2), 3) - Binomial (Binomial (n,3), 2).at n=8A093567
- Expansion of 1 + Sum_{i>=1} (x^prime(i)/Product_{j=1..i} (1-x^j)).at n=45A095700
- Record gaps between twin primes.at n=38A113274
- Riordan array (1/((1-4*x)*c(x)),x*c(x)/sqrt(1-4*x)), c(x) the g.f. of A000108.at n=40A113955
- Number of n-node triangulations of the nonorientable surface N_5 in which every node has degree >= 3.at n=2A129057
- Number of ways to toss a coin n times and not get a run of six.at n=13A135493