7042
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
- 8
- Divisor Sum
- 12096
- Proper Divisor Sum (Aliquot Sum)
- 5054
- 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
- 3012
- Möbius Function
- -1
- Radical
- 7042
- 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
- 106
- 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
- Boustrophedon transform of triangular numbers.at n=7A000746
- s(1)s(n) + s(2)s(n-1) + ... + s(k)s(n-k+1), where k = [ n/2 ], s = A001950 (upper Wythoff sequence).at n=21A025122
- Values of n such that 90n+11, 90n+13, 90n+17, 90n+19 are all primes.at n=42A051897
- Numbers n such that sopf(phi(n)) = phi(sopf(n)), where sopf(x) = sum of the distinct prime factors of x.at n=24A076531
- Number of permutations of length n which avoid the patterns 123, 3142, 4312; or avoid the patterns 123, 3421, 4231.at n=33A116721
- a(n) = A121678(n)/(n+1) = [x^n] (1 + x*(1+x)^n )^(n+1) / (n+1).at n=6A121679
- a(n) = sum of n successive primes after the n-th prime.at n=31A131740
- a(n) = 36*n^2 - n.at n=13A157286
- a(n) = 144*n^2 - 2*n.at n=6A158135
- a(n) = 196*n^2 - 14.at n=5A158553
- Triangle of coefficients of polynomials u(n,x) jointly generated with A210564; see the Formula section.at n=62A210563
- Number of 2-face-free maps on n edges.at n=7A220899
- Number of palindromic partitions of n whose greatest part has multiplicity <= 4.at n=47A238787
- Number of endofunctions f on [n] such that f^8(i) = f(i) for all i in [n].at n=7A245504
- Number of nonisomorphic binary n X n matrices with two 1's per column under row and column permutations.at n=7A247417
- a(n) = hypergeom([1, -n, -n-1], [2], 1).at n=6A247499
- Non-palindromic balanced numbers in base 16.at n=28A256080
- a(n) = 2*n^4 - floor(2^(1/4)*n)^4.at n=17A257854
- Number of trapezoidal words of length n.at n=35A260881
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 238", based on the 5-celled von Neumann neighborhood.at n=27A270986