7366
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 11520
- Proper Divisor Sum (Aliquot Sum)
- 4154
- 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
- 3528
- Möbius Function
- -1
- Radical
- 7366
- Omega Function (Ω)
- 3
- 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
- yes
- 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
- yes
- 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
- Number of bipartite partitions.at n=14A002768
- Numbers k such that phi(k + 12) | sigma(k) for k not congruent to 0 (mod 3).at n=29A015850
- Numbers k such that the continued fraction for sqrt(k) has period 70.at n=21A020409
- a(0) = 0; for n>0, a(n) = maximal number of regions into which space can be divided by n spheres.at n=29A046127
- Number of starting positions of Nim with 2n pieces such that 2nd player wins. Partitions of 2n such that xor-sum of partitions is 0.at n=22A048833
- Numbers k such that Euler phi(k) / Carmichael lambda(k) = 14.at n=15A066696
- Rounded volume of a regular octahedron with edge length n.at n=25A071400
- Start with 1 and repeatedly reverse the digits and add 61 to get the next term.at n=39A118156
- Triangle read by rows: T(n,k) is the number of deco polyominoes of height n and having k 2-cell columns starting at level 0 (n >= 1; 0 <= k <= n-1).at n=30A121634
- a(0)=1; for n > 0, a(n) = a(n-1) + a(prime(n)(mod n)), where prime(n) is the n-th prime.at n=41A127066
- 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, -1), (0, 0, 1), (1, 0, -1), (1, 0, 0)}.at n=8A149917
- Twice 11-gonal numbers: a(n) = n*(9*n-7).at n=29A152995
- G.f.: A(x) = Sum_{n>=0} x^n / (1 - x^n - x^(2*n))^n.at n=20A223547
- Bernoulli number B_{n} has denominator 354.at n=17A255684
- a(n) = (3^(n+1) - 2n^2 + 4n + 5) / 8.at n=9A262592
- a(2n) = A000125(n), a(2n+1) = 2*a(2n).at n=59A263614
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 262", based on the 5-celled von Neumann neighborhood.at n=36A271067
- Numbers k such that 7*10^k - 89 is prime.at n=17A281828
- Solution of the complementary equation a(n) = a(n-1) + a(n-2) + b(n-1), where a(0) = 1, a(1) = 2, b(0) = 3, and (a(n)) and (b(n)) are increasing complementary sequences.at n=15A294541
- Solution (a(n)) of the complementary equation a(n) = 2*a(n-1) - a(n-2) + b(n); see Comments.at n=31A305129