6167
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
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 7056
- Proper Divisor Sum (Aliquot Sum)
- 889
- 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
- 5280
- Möbius Function
- 1
- Radical
- 6167
- 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
- 36
- 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
- Juxtapose pairs of primes (starting at 1).at n=9A007794
- Expansion of Product_{m>=1} (1+q^m)^(-7).at n=12A022602
- Numbers k such that Fib(k) == 13 (mod k).at n=31A023178
- a(n) = sum of the numbers between the two n's in A026366.at n=40A026369
- 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=17A031575
- Numbers k > 1 such that k mod ord2(k) is even, where ord2(k) is the order of 2 mod k.at n=6A036260
- Numbers k such that k^4 can be written as a sum of four positive 4th powers with no common factor.at n=16A039664
- Concatenate the n-th and (n+1)st prime.at n=17A045533
- Value of index in A080900 when a number first appears for the n-th time.at n=4A080913
- G.f.: (1-x+2*x^2+2*x^3+2*x^4-x^5+x^6)/((1-x)*(1-x^2)^2*(1-x^3)).at n=41A083709
- Smallest m such that the decimal representation of the m-th prime interpreted in base n is not a prime, but prime in bases 10 <= b < n.at n=5A091922
- Smallest number which requires n iterations to reach a prime when iterating x + sum of squares of digits of x.at n=31A094658
- Number of distinct products of subsets of integers in the interval [n^2+1, (n+1)^2-1] which are twice a square.at n=42A099500
- Indices of primes in sequence defined by A(0) = 59, A(n) = 10*A(n-1) - 21 for n > 0.at n=17A101583
- Concatenations of pairs of primes that differ by 6.at n=11A103206
- Number of partitions of n having no parts equal to the size of their Durfee squares.at n=38A118199
- Numerator of Sum_{i=1..n} i^3/(n-i+1).at n=5A119783
- Numbers k such that 3*k+2, 4*k+3 and 5*k+4 are primes.at n=39A126956
- Triangle, read by rows, where T(n,k) = [(I + D*C)^n](n,k); that is, row n of T = row n of (I + D*C)^n for n>=0 where C denotes Pascal's triangle, I the identity matrix and D a matrix where D(n+1,n)=1 and zeros elsewhere.at n=30A134090
- Column 2 of triangle A134090.at n=5A134092