10171
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 10
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 11632
- Proper Divisor Sum (Aliquot Sum)
- 1461
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8712
- Möbius Function
- 1
- Radical
- 10171
- 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
- 86
- 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
- Expansion of 1/((1-4x)(1-6x)(1-9x)(1-12x)).at n=3A028141
- Number of partitions satisfying (cn(0,5) <= cn(2,5) and cn(0,5) <= cn(3,5) and cn(0,5) <= cn(1,5) and cn(0,5) <= cn(4,5)).at n=36A036801
- a(n) = A077727(n)/n.at n=34A077728
- Denominators of the convergents of the continued fraction for log(2).at n=12A079943
- Numbers k such that 4^k - 3^k - 2^k is prime.at n=9A138699
- 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, 0, 1), (0, 0, -1), (1, -1, 1), (1, 1, 0)}.at n=8A149277
- Numbers k such that (sum of base-2 digits of k) = (sum of base-10 digits of k) = 10.at n=7A152207
- Numbers n with property that n^2 is a concatenation of three 3-digit primes.at n=0A153139
- Arises in a refined modular approach to the Diophantine equation x^2+y^62=z^3.at n=11A172408
- The number of words of length n created with letters a, b, and c with at least as many a's as b's and at least as many b's as c's and no adjacent letters forming the pattern aba and no subwords (any adjacent or nonadjacent subsequence of letters) of the form abc.at n=12A176433
- a(0)=0, a(1)=1, for n>1, a(n) = a(n-1)*2 + floor(a(n-2)/n).at n=14A182442
- Numbers with exactly 11 nonprime substrings (substrings with leading zeros are considered to be nonprime).at n=16A213318
- Number of nX2 arrays of the minimum value of corresponding elements and their horizontal, vertical or antidiagonal neighbors in a random 0..2 nX2 array.at n=7A217639
- T(n,k)=Number of nXk arrays of the minimum value of corresponding elements and their horizontal, vertical or antidiagonal neighbors in a random 0..2 nXk array.at n=37A217645
- T(n,k)=Number of nXk arrays of the minimum value of corresponding elements and their horizontal, vertical or antidiagonal neighbors in a random 0..2 nXk array.at n=43A217645
- Number of sets (forests) of labeled identity trees (trees enumerated by A228159) with n nodes.at n=6A228160
- Number of partitions of n such that (maximal multiplicity of parts) > (multiplicity of the least part).at n=39A240304
- Nonprimes such that it takes exactly 3 iterations of reverse-and-add digits to generate a prime.at n=4A245208
- Sequence defined by a(1)=a(2)=1 and a(n) = gray(gray(a(n-1)) + gray(a(n-2))), with gray(m) = A003188(m).at n=27A265386
- Numbers k such that (17*10^k - 179)/9 is prime.at n=18A283246