7080
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
- 32
- Divisor Sum
- 21600
- Proper Divisor Sum (Aliquot Sum)
- 14520
- 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
- 1856
- Möbius Function
- 0
- Radical
- 1770
- Omega Function (Ω)
- 6
- 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
- 119
- 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
- Sum of 10 nonzero 8th powers.at n=13A003388
- a(n) = floor(n*(n+2)*(2*n-1)/8).at n=29A007518
- a(n) = floor( n*(n-1)*(n-2)/29 ).at n=60A011911
- Least term in period of continued fraction for sqrt(n) is 7.at n=14A031431
- Number of partitions of n into parts not of the form 17k, 17k+2 or 17k-2. Also number of partitions with 1 part of size 1 and differences between parts at distance 7 are greater than 1.at n=37A035963
- Numbers k such that phi(x) = k has exactly 9 solutions.at n=36A060672
- Triangle T(n,k) = d(n-k,n), 0 <= k <= n, where d(l,m) = Sum_{k=l..m} 2^k * binomial(2*m-2*k, m-k) * binomial(m+k, m) * binomial(k, l).at n=13A067001
- Barriers for bigomega(n): numbers n such that, for all m < n, m + bigomega(m) <= n.at n=38A068597
- a(n) = Sum_{k=1..n} -A068341(k+1)*a(n-k), a(0)=1.at n=13A073777
- Differences between two successive prime powers of prime numbers (A076707) in more than one way.at n=23A077257
- Differences between two successive powers of a prime but not a prime (A025475) in more than one way.at n=23A077274
- Integers that occur more than once as the difference of the squares of two consecutive primes.at n=29A078667
- 4 times hexagonal numbers: a(n) = 4*n*(2*n-1).at n=30A085250
- Least positive multiples of index n that can result from the self-convolution of a monotonically increasing sequence (A087148).at n=46A087149
- Numbers that can be expressed as the difference of the squares of consecutive primes in just two distinct ways.at n=26A090784
- Numbers that can be expressed as the difference of the squares of primes in exactly four distinct ways.at n=20A092000
- G.f.: (1+3*x^3)/((1-x)^2*(1-x^3)^2).at n=44A092352
- Numbers n such that 37*n^2 + 37*n + 1 is a square.at n=4A105844
- Numbers k such that k + sigma(k) is a triangular number.at n=33A115904
- Number of separated bicyclic skeletons with n carbon atoms (see Parks et al. for precise definition).at n=6A121163