7193
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 7194
- 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
- 7192
- Möbius Function
- -1
- Radical
- 7193
- 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
- 163
- 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
- yes
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 919
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- a(n) = 2*a(n-1) + (n-1)*a(n-2).at n=8A005425
- a(n) is the sum over all floor(k^3/n), k=0 to n inclusive.at n=29A014818
- Numbers k such that the continued fraction for sqrt(k) has period 59.at n=7A020398
- Right-truncatable primes: every prefix is prime.at n=39A024770
- Number of independent subsets of nodes in graph formed from n-fold subdivision of 7-dimensional simplex.at n=3A027734
- Lower prime of a pair of consecutive primes having a difference of 14.at n=36A031932
- Primes with indices that are primes with prime indices.at n=36A038580
- Number of partitions satisfying cn(0,5) + cn(2,5) <= cn(1,5) and cn(0,5) + cn(2,5) <= cn(4,5) and cn(0,5) + cn(3,5) <= cn(1,5) and cn(0,5) + cn(3,5) <= cn(4,5).at n=42A039883
- Numbers whose base-5 representation contains exactly three 2's and two 3's.at n=26A045276
- Primes with first digit 7.at n=36A045713
- Number of partitions of n with equal nonzero number of parts congruent to each of 0, 1 and 2 (mod 4).at n=59A046778
- a(n+1) is next smallest prime beginning with a(n), initial prime is a(0) = 7.at n=3A048552
- Primes prime(k) for which A049076(k) = 4.at n=6A049080
- Primes for which A049076 >= 4.at n=11A049090
- a(n) = a(n-1) + a(m) for n >= 4, where m = 2*n - 3 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = a(2) = 1 and a(3) = 2.at n=44A050028
- a(n) = a(n-1) + a(m) for n >= 4, where m = 2*n - 3 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1 and a(2) = a(3) = 2.at n=44A050044
- a(n) = a(n-1) + a(m) for n >= 4, where m = 2*n - 3 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1, a(2) = 3, and a(3) = 2.at n=44A050060
- Numbers k such that 285*2^k-1 is prime.at n=36A050901
- Primes arising in A053782.at n=19A053872
- Prime recurrence: a(n+1) = a(n)-th prime, with a(1) = 12.at n=4A057457