7035
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 13056
- Proper Divisor Sum (Aliquot Sum)
- 6021
- 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
- 3168
- Möbius Function
- 1
- Radical
- 7035
- Omega Function (Ω)
- 4
- 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
- yes
- 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
- no
- Odd
- yes
Appears in sequences
- Orders of cyclotomic polynomials containing a coefficient the absolute value of which is >= 5.at n=30A013593
- Number of parts in all partitions of n into distinct parts.at n=41A015723
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (Lucas numbers), t = (odd natural numbers).at n=18A024473
- Numbers that, when expressed in base 3 and then interpreted in base 10, yield a multiple of the original number.at n=30A032537
- Number of 2-element intersecting families of an n-element set; number of 2-way interactions when 2 subsets of power set on {1..n} are chosen at random.at n=6A036239
- Squarefree odd numbers with exactly 4 distinct prime factors.at n=41A046390
- Number of nonempty subsets of {1,2,...,n} in which exactly 4/5 of the elements are <= (n-4)/2.at n=23A048068
- a(n)=a(n-1)+a(m), where m=2n-2-2^(p+1) and 2^p<n-1<=2^(p+1), for n >= 4.at n=29A050059
- Minimal m such that n^n-m and n^n+m are both primes, or -1 if there is no such m.at n=32A075468
- 2-nadirs of phi: numbers k such that phi(k-2) > phi(k-1) > phi(k) < phi(k+1) < phi(k+2).at n=34A076773
- a(n) = A000217(A000217(n))-n^2.at n=15A086602
- a(n) is the difference between the largest and smallest integer solutions to n=x/pi(x), where pi(x) = A000720(x).at n=19A087236
- a(n) = K_3(n) = Sum_{k>=0} A090285(3,k)*2^k*binomial(n,k). a(n) = (4*n^3+30*n^2+56*n+15)/3.at n=15A090294
- Odd squarefree numbers k such that k/phi(k) > 2, where phi is Euler's totient function.at n=39A091495
- Matrix inverse of A008278, which is the reflected triangle of the Stirling numbers of 2nd kind.at n=33A106342
- Numbers k for which nontrivial positive magic squares of exactly 8 different orders with magic sum k exist. For a definition of nontrivial positive magic squares, see A125005.at n=29A125015
- Numbers k such that 15^k - 2 is a prime.at n=12A128458
- a(n) = A143702(n)/2.at n=19A143703
- Expansion of x/(1 - 4*x + 6*x^2 - 5*x^3 + 4*x^4 - 3*x^5).at n=14A144897
- a(n) = 441*n^2 - 21.at n=3A145678