7365
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 11808
- Proper Divisor Sum (Aliquot Sum)
- 4443
- 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
- 3920
- Möbius Function
- -1
- Radical
- 7365
- 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
- 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
- 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
- no
- Odd
- yes
Appears in sequences
- Coefficient of q^(2n-1) in the series expansion of Ramanujan's mock theta function f(q).at n=42A000199
- Number of permutations of up to n kinds of objects, where each kind of object can occur at most two times.at n=4A003011
- a(n) = Sum_{k=0..n-1} T(n,k) * T(n,k+1), with T given by A026659.at n=6A026977
- Trajectory of n under the Reverse and Add! operation carried out in base 3 (presumably) does not reach a palindrome and (presumably) does not join the trajectory of any term m < n.at n=26A077405
- Numbers n such that nextprime(n^3)-prevprime(n^3) = 4.at n=36A090121
- Numbers n occurring in binary representation of n*(n+1)/2.at n=37A092734
- a(n) = a(n-1) + Sum_{k=0..floor(log_2(n-1))} a(2^k), a(1) = 1.at n=26A133147
- Expansion of (1+x)*(1+x^2)/((1-x)^2*(1+x+x^2)*(1-4*x)).at n=6A141844
- a(n) = Sum_{i=0..n} Sum_{j=0..n} Sum_{k=0..n} Sum_{l=0..n} (i+j+k+l)!/(i!*j!*k!*l!).at n=2A144661
- Numbers k such that (k^3 - 2, k^3 + 2) is a pair of cousin primes (see A178227).at n=35A178228
- Numbers k such that there are 2 primes between 100*k and 100*k + 99.at n=17A186394
- a(n) = A192457(n)/2.at n=5A192458
- Number of n X 2 0..2 arrays with every nonzero element less than or equal to at least two horizontal and vertical neighbors.at n=8A203454
- T(n,k) = Number of n X k 0..2 arrays with every nonzero element less than or equal to at least two horizontal and vertical neighbors.at n=46A203460
- Number of primes p < 10^n such that both 2*p+1 and 4*p+1 are composite.at n=4A210684
- Numbers k such that 9^k + 4 is prime.at n=13A217384
- Number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 165", based on the 5-celled von Neumann neighborhood.at n=45A270457
- In the binary race of Pi, where the race leader changes.at n=28A278920
- a(1) = 1; a(n+1) is the smallest k > a(n) such that 2^k == 2^a(n) (mod a(n)).at n=35A306829
- A(n,k) = Sum_{i_1=0..n} Sum_{i_2=0..n} ... Sum_{i_k=0..n} multinomial(i_1 + i_2 + ... + i_k; i_1, i_2, ..., i_k), square array A(n,k) read by antidiagonals, for n >= 0, k >= 0.at n=23A308292