7316
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 13440
- Proper Divisor Sum (Aliquot Sum)
- 6124
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3480
- Möbius Function
- 0
- Radical
- 3658
- 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
- Definition (1): Number of n-bead binary necklaces with beads of 2 colors where the colors may be swapped but turning over is not allowed.at n=18A000013
- Number of even sequences with period 2n (bisection of A000013).at n=9A000116
- Number of bipartite partitions of n white objects and 3 black ones.at n=16A000412
- Initial pile sizes which guarantee a win for player 2 in a certain variant of Nim.at n=37A016741
- Number of nonisomorphic self-complementary circulant digraphs (Cayley digraphs for the cyclic group) of order 2n-1.at n=18A049309
- Number of complementary pairs of circulant graphs on n nodes.at n=36A054929
- Number of complementary pairs of circulant digraphs on n nodes.at n=18A054930
- Number of symmetric types of (5,2n)-hypergraphs under action of complementing group C(5,2).at n=4A055788
- a(n) = (n+1)!*Sum_{k=0..n} C(2k, k)*B(n-k), where B(n) is n-th Bernoulli number.at n=4A061053
- Number of inequivalent (ordered) solutions to n^2 = sum of 8 squares of integers >= 0.at n=33A065462
- G.f.: Sum_{n >= 1} x^n/(1-x^n)^5.at n=18A073570
- Sum of squares of digits of n is equal to the largest prime factor of n reversed, where the largest prime factor is not a palindrome.at n=13A074303
- Number of positive numbers m such that A073642(m) = n.at n=50A087135
- Numbers k such that k^4096 + 1 is prime (a generalized Fermat prime).at n=2A088362
- a(n) = (1/2)*number of non-degenerate triangular pyramids that can be formed using 4 distinct points chosen from an (n+1) X (n+1) X (n+1) lattice cube.at n=1A103656
- Number of cycles for the map LL:x->x^2-2 acting on Z/(2^n-1).at n=19A128976
- Expansion of psi(x^6) / psi(-x) in powers of x where psi() is a Ramanujan theta function.at n=40A132217
- A007318 * A077028.at n=58A134395
- a(n) = 1 + (6 + (11 + (6 + n)*n)*n)*n/24.at n=19A145126
- Given n points in the complex plane, let M(n) the number of distinct Moebius transformations that take 3 distinct points to 3 distinct points. Note that the triples may have some or all of the points in common.at n=4A158121