15177
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 20240
- Proper Divisor Sum (Aliquot Sum)
- 5063
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 10116
- Möbius Function
- 1
- Radical
- 15177
- 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
- 177
- 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 even period and if the last term of the periodic part is deleted the central term is 82.at n=29A031580
- a(n) is the least index such that the least primitive root of the a(n)-th prime is n, or zero if no such prime exists.at n=38A066529
- Numbers n such that [A070080(n), A070081(n), A070082(n)] is an isosceles integer triangle with integer area.at n=29A070145
- Triangle read by rows: number of labeled partitions of n with maximin m.at n=50A113547
- Number of n X n binary arrays symmetric under 90 degree rotation with all ones connected only in a 1110-0100-0111 pattern in any orientation.at n=14A146877
- In those partitions of n with every part >=3, the total number of parts (counted with multiplicity).at n=42A177739
- Number of (w,x,y,z) with all terms in {0,...,n} and w=2*floor((x+y+z)/2).at n=42A212748
- Triangle read by rows, coefficients of the generalized Eulerian polynomials A_{n, 3}(x) in descending order.at n=22A225117
- Number of partitions p of n not including floor(mean(p)) as a part.at n=40A241335
- a(n) = Sum_{k=1..n} Stirling2(n,k)*(k!)^3.at n=3A263158
- Halogen sequence: a(n) = A018227(n)-1.at n=42A271999
- Row sums of the array A274196, defined by g(n,k) = 1 for n >= 0; g(n,k) = 0 if k > n; g(n,k) = g(n-1,k-1) + g(n-1,4k) for n > 0, k > 1.at n=44A274197
- Expansion of Product_{k>=1} (1 - x^(12*k)) * (1 - x^(4*k-2)) / (1 - x^k).at n=49A280949
- Triangle read by rows, (Sum_{k=0..n} T[n,k]*x^k) / (1-x)^(n+1) are generating functions of the columns of A287698.at n=23A287697
- a(n) = number of n-digit binary numbers in which the first k and last k digits have a Hamming distance of 1 or less, for all k from 1 to n.at n=45A288793
- Triangle read by rows: T(n,k) is the number of ordered triples of n-permutations with exactly k common descents, n>=0, 0<=k<=max(0,n-1).at n=20A334394
- Starts of runs of 3 consecutive numbers with the same total binary weight of their divisors (A093653).at n=13A338453
- a(n) = Sum_{k=0..floor(n/2)} (n-k)^(n-2*k) * |Stirling1(n-k,k)|.at n=6A353290
- Triangle read by rows: T(n,m), n >= 1, 1 <= m <= n, is number of partitions of the set {1,2,...,n} that have at most one block contained in {1,...,m}.at n=39A362924
- Triangle read by rows: T(n,m), n >= 0, 0 <= m <= n, is number of partitions of the set {1,2,...,n} that have at most one block contained in {1,...,m}.at n=49A362925