7321
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
- 2
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 7322
- Proper Divisor Sum (Aliquot Sum)
- 1
- 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
- 7320
- Möbius Function
- -1
- Radical
- 7321
- Omega Function (Ω)
- 1
- Little Omega Function (ω)
- 1
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
- 44
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- yes
- Composite Number
- no
- Semiprime
- no
- Squarefree Number
- yes
- Prime Power
- yes
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 933
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Primes p such that the multiplicative order of 2 modulo p is (p-1)/6.at n=47A001136
- Smallest prime p such that the product of q/(q-1) over the primes from prime(n) to p is greater than 2.at n=21A001275
- Half-quartan primes: primes of the form p = (x^4 + y^4)/2.at n=6A002646
- Number of nodes in regular n-gon with all diagonals drawn.at n=23A007569
- Powers of fifth root of 24 rounded down.at n=14A018183
- Powers of fifth root of 24 rounded to nearest integer.at n=14A018184
- a(n) = least m such that if r and s in {1/2, 1/4, 1/6, ..., 1/(2*n)} satisfy r < s, then r < k/m < (k+3)/m < s for some integer k.at n=31A024845
- Primes of the form j^2 + (j+1)^2.at n=22A027862
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 50 ones.at n=22A031818
- a(n) = (11^n + 1)/2.at n=4A034659
- Denominators of continued fraction convergents to sqrt(593).at n=10A042137
- Upper members of a "good pair" of the form (k, 2*k +- 1).at n=39A046862
- Primes of the form k^2 + k + 11.at n=44A048059
- Primes with distinct digits in descending order.at n=34A052014
- Run through primes p; if the digits of p*q (where q is the prime following p) can be rearranged to form one or more primes r, append these primes r to the sequence.at n=36A053736
- Primes p such that x^61 = 2 has no solution mod p.at n=15A059230
- Primes p such that |p - q| is a square, where q is the reversal of p.at n=26A059798
- Largest prime factor of 11^n+1 (A034524).at n=4A062308
- Primes of the form k^2 + prime(k) + 1.at n=6A063461
- Numbers having exactly eight anti-divisors.at n=45A066474