6790
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 14112
- Proper Divisor Sum (Aliquot Sum)
- 7322
- 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
- 2304
- Möbius Function
- 1
- Radical
- 6790
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 36
- 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
- Expansion of Product_{m>=1} (1 + m*q^m)^7.at n=6A022635
- a(n) = b(n) + d(n), where b(n) = (n-th Fibonacci number > 1) and d(n) = (n-th non-Fibonacci number).at n=17A023483
- n-th non-Lucas number plus Fibonacci(n + 1).at n=18A023490
- Numbers with exactly five distinct base-9 digits.at n=21A031986
- Numbers n such that lcm(sigma(n),phi(n)) is a perfect square.at n=41A043293
- Number of unlabeled mobiles with cycles of length at least 3.at n=16A052523
- Rounded total surface area of a regular icosahedron with edge length n.at n=28A071398
- Number of permutations of length n which avoid the patterns 321, 1342, 3124.at n=17A116718
- Numbers k such that 2*F(k) + 1 is a prime, where F = A000045.at n=42A124067
- Triangle read by rows: T(n,k) is the number of connected directed multigraphs with loops and no vertex of degree 0, with n arcs and k vertices.at n=34A139621
- 7 times heptagonal numbers: a(n) = 7*n*(5*n-3)/2.at n=20A152777
- Concatenation of odd n and even n-th nonprime.at n=22A155486
- a(n) = 343*n - 70.at n=19A157374
- A(x) satisfies A000290(x)/x^2 = A(x)/A(x^2); A000290 = integer squares.at n=12A173277
- Number of strings of numbers x(i=1..n) in 0..2 with sum i*x(i) equal to n*2.at n=20A184696
- Number of 1X5 integer matrices with each row summing to zero, row elements in nondecreasing order, rows in lexicographically nondecreasing order, and the sum of squares of the elements <= 2*n^2 (number of collections of 1 zero-sum 5-vectors with total modulus squared not more than 2*n^2, ignoring vector and component permutations).at n=16A192692
- Triangle of coefficients of Chebyshev's S(n,x+5) polynomials (exponents of x in increasing order).at n=41A207824
- Alternating square row sums of the table A072233 (A008284).at n=28A238313
- Number of partitions of n having (sum of odd parts) > (sum of even parts).at n=34A239262
- Number of partitions of n having (sum of odd parts) >= (sum of even parts).at n=34A239263