7240
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 16380
- Proper Divisor Sum (Aliquot Sum)
- 9140
- 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
- 2880
- Möbius Function
- 0
- Radical
- 1810
- Omega Function (Ω)
- 5
- 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
- Expansion of 1/((1-4x)(1-10x)(1-12x)).at n=3A019747
- Triangle of Gaussian binomial coefficients [ n,k ] for q = 19.at n=13A022183
- Triangle of Gaussian binomial coefficients [ n,k ] for q = 19.at n=11A022183
- 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 41.at n=35A031539
- a(n) = floor(n^3 / e).at n=27A032636
- Triangle read by rows giving T(n,k) = number of inequivalent indecomposable linear [ n,k ] binary codes without 0 columns (n >= 2, 1 <= k <= n).at n=73A034254
- Triangle read by rows giving T(n,k) = number of inequivalent indecomposable linear [ n,k ] binary codes without 0 columns (n >= 2, 1 <= k <= n).at n=70A034254
- Number of indecomposable binary [ n,5 ] codes without 0 columns.at n=12A034352
- Number of indecomposable binary [ n,8 ] codes without 0 columns.at n=12A034355
- Number of sublattices of index n in generic 4-dimensional lattice.at n=18A038991
- a(n) = n^3 + n^2 + n + 1.at n=19A053698
- Triangle A(n,m) of numbers of n-element ordered T_0-antichains on an unlabeled m-set or numbers of T_1-hypergraphs on n labeled nodes with m (not necessarily empty) distinct hyperedges (m=0,1,...,2^n).at n=29A059048
- a(n) = Z(S_m; sigma[1](n), sigma[2](n),..., sigma[m](n)) where Z(S_m; x_1,x_2,...,x_m) is the cycle index of the symmetric group S_m and sigma[k](n) is the sum of k-th powers of divisors of n; m=3.at n=18A068020
- For a partition P of a positive integer, let f(P) be the product of k+1, over all parts k in P. Let a(n,r) be the sum of f(P) over all partitions P of n with smallest part r. Sequence gives table of a(n,r) for 1 <= r <= n, in the order a(1,1); a(2,1), a(2,2); a(3,1), a(3,2), a(3,3); ...at n=45A079308
- Numbers n such that ((n-1)^2+1)/2 and n^2+1 and ((n+1)^2+1)/2 are prime if n is even or (n-1)^2+1 and (n^2+1)/2 and (n+1)^2+1 are prime if n is odd.at n=37A082612
- Short leg of primitive Pythagorean triangles having legs that add up to a square, sorted on hypotenuse.at n=23A089547
- A sequence related to the even-indexed Catalan numbers.at n=7A098469
- Number of partitions of n into parts without powers of 2.at n=59A101417
- Real part of absolute Gaussian perfect numbers, in order of increasing magnitude.at n=21A102531
- Start with 34 and repeatedly reverse the digits and add 16 to get the next term.at n=24A119454