7340
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 15456
- Proper Divisor Sum (Aliquot Sum)
- 8116
- 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
- 2928
- Möbius Function
- 0
- Radical
- 3670
- 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
- 132
- 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
- Molien series of 4-dimensional representation of u.g.g.r. #8.at n=25A013978
- Number of symmetric 4 X 4 matrices of nonnegative integers with every row and column adding to n.at n=7A053493
- Second 11-gonal (or hendecagonal) numbers: a(n) = n*(9*n+7)/2.at n=40A062728
- Convolution of Fibonacci F(n+1), n>=0, with F(n+7), n>=0.at n=9A067430
- Number of solutions to n^2 < x^2 + y^2 + z^2 < (n+1)^2; number of lattice points between spheres of radii n and n+1.at n=24A078184
- Number of partitions of 2n in which both odd parts and parts that are multiples of 3 occur with even multiplicities. There is no restriction on the other even parts.at n=22A101230
- Maximum denominator among the n! ratios equal to the continued fractions which have the permutations of (1,2,3,...,n) for terms.at n=6A105216
- Number of orbits of the 5-step recursion mod n.at n=39A106287
- Sums of rows of the triangle in A116366.at n=33A116367
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 1, 0), (0, 1, 0), (1, 0, 1), (1, 1, -1)}.at n=7A150293
- T(n,k) = Number of (n*k) X k binary arrays with rows in nonincreasing order, n ones in every column and no more than 2 ones in any row.at n=51A188403
- Number of (7*n) X n binary arrays with rows in nonincreasing order, 7 ones in every column and no more than 2 ones in any row.at n=4A188408
- Constant term of the reduction by x^2 -> x+1 of the polynomial p(n,x) defined at Comments.at n=16A192981
- Number of 2 X 2 matrices having all elements in {-n,...n} and determinant 4.at n=20A209988
- Triangle T(n,k) = t(n-k, k); t(n,m) = f(m)*t(n-1,m) + f(n)*t(n,m-1), where f(x) = x + 2.at n=29A256890
- Triangle T(n,k) = t(n-k, k); t(n,m) = f(m)*t(n-1,m) + f(n)*t(n,m-1), where f(x) = x + 2.at n=34A256890
- Expansion of 1/(1 - Sum_{k>=2} floor(bigomega(k)/2)*floor(2/bigomega(k))*x^k), where bigomega(k) is the number of prime divisors of k counted with multiplicity (A001222).at n=48A280238
- Numbers k such that 8*10^k - 13 is prime.at n=20A287208
- Start with 209; if even, divide by 2; if odd, add the next three primes: Trajectory of 209 under iterations of A174221, the "PrimeLatz" map.at n=13A293981
- Numbers k such that k and k-1 both first appear in the same power of 2 (in base 10).at n=34A322919