7026
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
- 8
- Divisor Sum
- 14064
- Proper Divisor Sum (Aliquot Sum)
- 7038
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 2340
- Möbius Function
- -1
- Radical
- 7026
- 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
- 57
- Smith Number
- yes
- 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
- Tetranacci numbers arising in connection with current algebras sp(2)_n.at n=12A014610
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 82.at n=23A031580
- Numbers n such that n^1024 + 1 is prime (a generalized Fermat prime).at n=12A057002
- Numbers k such that the sum of digits of k^k is a square.at n=46A066236
- Duplicate of A057002.at n=12A088360
- Lesser of twin admirable numbers: k such that k and k+2 are both admirable numbers.at n=28A109730
- Number of leaf nodes in a binary tree.at n=20A112088
- a(n) = {2^n}_n.at n=11A122636
- Triangular array with the first half of the odd-indexed rows of A048004.at n=42A125105
- Number of different values of i^2+j^2+k^2+l^2+m^2+n^2 for i,j,k,l,m,n in [0,n].at n=36A132438
- Triangle read by rows: matrix inverse of A154959.at n=16A154960
- 2nd column of A154960.at n=5A154961
- Expansion (1-sqrt(1-4*x))/(2*(1-x^4-x)).at n=9A200966
- Number of partitions of n into divisors > 1 of n.at n=60A211110
- Number of primitive Pythagorean triples with perimeter < 10^n.at n=4A249750
- Expansion of Product_{k>=1} 1/(1-x^k)^(k*(k+1)*(k+2)).at n=5A258350
- Expansion of Sum_{k>=1} x^k*(1 + x^k)/(1 - x^k)^4.at n=25A320941
- Irregular triangular array T(n,k) read by rows: T(n,k) is the number of degree n monic polynomials in GF(2)[x] with exactly k distinct factors in its unique factorization into irreducible polynomials.at n=55A329721
- Square array T(n, k) (n>=1, k>=1) read by antidiagonals upwards. T(n, k) is the number of partitions of the set [n] into lists of k noncrossing sets.at n=50A348702
- Square array T(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where T(n,k) = [x^n] 1/(1 - x*(1+x)^k)^n.at n=60A362078