13166
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 20520
- Proper Divisor Sum (Aliquot Sum)
- 7354
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6328
- Möbius Function
- -1
- Radical
- 13166
- 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
- 138
- 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
- yes
- Odd
- no
Appears in sequences
- Values of m in the discriminant D = -4*m leading to a new maximum of the L-function of the Dirichlet series L(1) = Sum_{k=1..oo} Kronecker(D,k)/k.at n=24A003420
- Numbers k such that 163*2^k+1 is prime.at n=35A032458
- Number of polyominoes with perimeter at most 2n.at n=9A130622
- Number of ordered triples (w,x,y) with all terms in {1,...,n} and 2*w^2 < x^2 + y^2.at n=28A211800
- Number of binary strings of length n avoiding the pattern x x x^R (where x^R means reverse of x).at n=55A241903
- Bernoulli number B_{n} has denominator 354.at n=31A255684
- T(n,k)=Number of (n+1)X(k+1) arrays of permutations of 0..(n+1)*(k+1)-1 with each element having directed index change 0,1 2,2 1,0 -1,2 -2,-1 or -1,-1.at n=46A264422
- Number of (2+1) X (n+1) arrays of permutations of 0..n*3+2 with each element having directed index change 0,1 2,2 1,0 -1,2 -2,-1 or -1,-1.at n=8A264423
- Number of length n inversion sequences avoiding the patterns 120, 201, and 210.at n=8A279572
- Numbers k, the smallest of at least 4 consecutive numbers x, for which phi(x) <= phi(x+1).at n=41A295865
- Sum of all the parts in the partitions of n into 6 parts.at n=29A308867
- Numbers k such that phi(k) < phi(k+1) < phi(k+2) < phi(k+3) where phi is the Euler totient function (A000010).at n=29A327880
- Sum, over all binary strings w of length n, of the length of the longest border of w.at n=12A331393
- Addends k > 0 such that x^2 + k produces a new minimum of its Hardy-Littlewood Constant.at n=25A331949
- Number of partitions of n into 5 or more distinct parts.at n=48A347572
- Number of subsets of {1..n} whose cardinality is not equal to the sum of any subset.at n=16A367217