10173
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 13568
- Proper Divisor Sum (Aliquot Sum)
- 3395
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6780
- Möbius Function
- 1
- Radical
- 10173
- 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
- 179
- 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
- Numbers k such that the continued fraction for sqrt(k) has period 82.at n=28A020421
- Lucky numbers with size of gaps equal to 20 (upper terms).at n=20A031903
- a(n) = smallest k such that the Reverse and Add! trajectory of A063048(n) joins the trajectory of k.at n=37A089493
- Triangle read by rows: T(n,k) = number of peakless Motzkin paths of length n containing k U H^j Us for some j>0, where U=(1,1) and H=(1,0) (can be easily expressed using RNA secondary structure terminology).at n=51A097777
- Number of n X n binary arrays symmetric under 180 degree rotation with all ones connected only in a 1000-1000-1111 pattern in any orientation.at n=9A146601
- Sequence defined by the recurrence formula a(n+1)=sum(a(p)*a(n-p)+k,p=0..n)+l for n>=1, with here a(0)=1, a(1)=0, k=-1 and l=-1.at n=10A176952
- a(n) = Sum_{i=1...n} Sum_{j=1..i} lcm(i,j)/i.at n=42A232533
- Numbers m such that A166133(m+1) = A166133(m)^2 - 1.at n=19A256703
- Number of Dyck paths of semilength n such that the maximal number of peaks per level equals four.at n=7A288745
- Total height of all symmetrically unique Dyck paths of semilength n.at n=9A291886
- Triangle T(n,k) read by rows: number of simple connected graphs with n nodes and k endpoints, n >= 0, 0 <= k <= n.at n=47A304222
- x-value of the smallest solution to 2*x^2 - p*y^2 = (-1)^((p+1)/4), p = A002145(n).at n=38A306618
- Indices n of Riemann zeta zeros where the Riemann-Siegel Z function sets successive records of maximum absolute values abs(Z(t)) in the interval between the n-th and (n+1)-th zeros.at n=31A329823
- Number of integer partitions of n where some part is the difference of two consecutive parts.at n=34A364467
- First term is 1; thereafter, if u and v are consecutive terms, with decimal expansions u = bc...ef, v = hi...jk, then v-u has decimal expansion efhi, formed by concatenating the last two digits of u and the first two digits of v. If there is a choice for v, pick the smallest.at n=4A367363