6191
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
- 4
- Divisor Sum
- 6384
- Proper Divisor Sum (Aliquot Sum)
- 193
- 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
- 6000
- Möbius Function
- 1
- Radical
- 6191
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 2
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
- 168
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- a(n) = a(n-1) + 5*a(n-2), with a(0) = a(1) = 1.at n=9A015440
- Positive integers n such that 2^n == 2^11 (mod n).at n=62A015935
- Pseudoprimes to base 59.at n=29A020187
- Pseudoprimes to base 92.at n=44A020220
- Strong pseudoprimes to base 59.at n=11A020285
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 77.at n=19A031575
- Number of partitions satisfying cn(0,5) + cn(1,5) <= cn(2,5) + cn(3,5) and cn(0,5) + cn(4,5) <= cn(2,5) + cn(3,5).at n=34A039886
- Composite numbers not ending in zero that yield a prime when turned upside down.at n=35A048889
- Number of partitions of n in SPM(n): these are the partitions obtained from (n) by iteration of the following transformation: p -> p' if p' is a partition (i.e., decreasing) and p' is obtained from p by removing a unit from the i-th component of p and adding one to the (i+1)-th component, for any i.at n=41A056219
- Numbers k such that 2^k + 11 is prime.at n=19A102633
- Number of permutations of length n which avoid the patterns 2134, 3214, 4312.at n=8A116745
- Row sums of triangle A120072 (numerator triangle for H atom spectrum).at n=24A120074
- Sum of the quadratic nonresidues of prime(n).at n=35A125615
- a(n) = least k >= 1 such that the remainder when 6^k is divided by k is n.at n=12A127816
- 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), (-1, 0, -1), (0, 1, 1), (1, -1, -1)}.at n=10A148064
- a(n) = 144*n - 1.at n=42A158136
- Number of cycles of n-digit numbers (including fixed points) under the Kaprekar map A151949.at n=51A164731
- Number of subsets of {1, 2, ..., n} containing n and having <=7 pairwise coprime elements.at n=37A186991
- G.f.: Sum_{n>=0} x^n / (1-x)^(n^3).at n=6A230050
- Number of partitions p of n such that (sum of parts with multiplicity 1) < (sum of all other parts).at n=34A240448