7180
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 15120
- Proper Divisor Sum (Aliquot Sum)
- 7940
- 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
- 2864
- Möbius Function
- 0
- Radical
- 3590
- 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
- 70
- 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
- yes
- Odd
- no
Appears in sequences
- Generalized class numbers c_(n,1).at n=45A000233
- Colored series-parallel networks.at n=6A001574
- a(n) = floor( n*(n-1)*(n-2)/5 ).at n=34A011887
- a(n) = n*(9*n - 1)/2.at n=40A022266
- a(n) = (d(n)-r(n))/2, where d = A026060 and r is the periodic sequence with fundamental period (1,0,0,0).at n=35A026061
- Numbers whose base-4 representation contains exactly four 0's and two 3's.at n=16A045083
- Number of distinct non-extendable sequences (x(1),x(2),...,x(k)) such that each x(i) is in {1,2,...,n} and (x(j) AND x(i)) <> x(j) for i=2..k, j=1..i-1.at n=8A053623
- McKay-Thompson series of class 30d for Monster.at n=31A058625
- Triangle T(n,k) of k-block ordered bicoverings of an unlabeled n-set, n >= 2, k = 3..n+floor(n/2).at n=21A060092
- Number of 5-block ordered bicoverings of an unlabeled n-set.at n=7A060093
- Triangle of coefficients T[n,m] of polynomials n, n^2, (n+2n^3)/3, n^2(2+n^2)/3, n(3+10n^2+2n^4)/15, etc. after multiplication by the denominators (A049606).at n=48A064984
- Number of prime pairs below 10^n having a difference of 42.at n=6A093975
- Positive integers k such that k^20 + 1 is semiprime (A001358).at n=28A105282
- Smallest number k such that k^n is equal to the sum of n consecutive primes, or 1 if it does not exist.at n=23A123112
- Nonnegative values x of solutions (x, y) to the Diophantine equation x^2+(x+359)^2 = y^2.at n=6A130610
- a(n) = floor(n*exp(-tan(n))).at n=7A134907
- a(n) = 250*n - 70.at n=29A154361
- Triangle T(n,m,p,q) = (p^(n-k)*q^k + p^k*q^(n-k))*(StirlingS1(n, k) + StirlingS1(n, n-k)) with p=2 and q=1, read by rows.at n=23A154913
- Triangle T(n,m,p,q) = (p^(n-k)*q^k + p^k*q^(n-k))*(StirlingS1(n, k) + StirlingS1(n, n-k)) with p=2 and q=1, read by rows.at n=25A154913
- S(n) - the sum of the areas of the polygons constructed from connecting with a straight line all identical members in the multiplicative table modulo n (finite field).at n=22A157023