7029
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 11232
- Proper Divisor Sum (Aliquot Sum)
- 4203
- 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
- 4200
- Möbius Function
- 0
- Radical
- 2343
- Omega Function (Ω)
- 4
- 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
- 57
- 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
- no
- Odd
- yes
Appears in sequences
- a(n) = n*(29*n + 1)/2.at n=22A022287
- Convolution of (1, p(1), p(2), ...) and composite numbers.at n=19A023627
- Number of primes between n*100000 and (n+1)*100000.at n=14A038825
- Numbers k such that 171*2^k-1 is prime.at n=26A050837
- Numbers k such that k copies of 12 followed by 1 is a palindromic prime.at n=9A056803
- Numbers primitive with respect to having more than one factorization into S-primes. See related sequences for definition.at n=38A057950
- Long leg of primitive Pythagorean triangles having legs that add up to a square, sorted on hypotenuse.at n=11A089548
- a(n) is the least positive integer such that nextprime(a(n)^n) - prevprime(a(n)^n) = 4.at n=27A090125
- a(0) = 10; for n > 0, a(n) is determined by the rule that the concatenation of the leading terms of the difference triangle is the same as the concatenation of the digits of the sequence.at n=11A125588
- Sum of all n-digit Wedderburn-Etherington numbers.at n=3A132010
- 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, 0), (0, -1, 1), (1, 0, -1), (1, 1, 1)}.at n=7A149782
- Triangle T(n, k) = coefficients of ( t(n, x) ) where t(n, x) = (1-x)^(n+1)*p(n, x)/x, p(n, x) = x*D( p(n-1, x) ), with p(1, x) = x/(1-x)^2, p(2, x) = x*(1+x)/(1-x)^3, and p(3, x) = x*(1+8*x+x^2)/(1-x)^4, read by rows.at n=30A166340
- Triangle T(n, k) = coefficients of ( t(n, x) ) where t(n, x) = (1-x)^(n+1)*p(n, x)/x, p(n, x) = x*D( p(n-1, x) ), with p(1, x) = x/(1-x)^2, p(2, x) = x*(1+x)/(1-x)^3, and p(3, x) = x*(1+8*x+x^2)/(1-x)^4, read by rows.at n=33A166340
- a(n) = n*(13*n-3)/2.at n=33A186030
- Numbers n such that 9n is a partition number.at n=6A222179
- Semiperimeters s of primitive Pythagorean triples (a, b, c) where a, b, c and s are not squarefree.at n=16A237620
- Number of partitions of n such that m(1) = m(3), where m = multiplicity.at n=42A240058
- Total number of ON cells at stage 2n of two-dimensional 5-neighbor outer totalistic cellular automaton defined by "Rule 457".at n=49A246327
- E.g.f. S(x) satisfies: C(x)^2 + 2*S(x)^2 = 1 such that S'(x) = C(x)^2 - S(x)*C(x) and C'(x) = 2*S(x)^2 - 2*S(x)*C(x), where C(x) is described by A279841.at n=7A279842
- Numbers n such that 11^n is the highest power of 11 dividing A240751(n).at n=34A286006