15182
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
- 4
- Divisor Sum
- 22776
- Proper Divisor Sum (Aliquot Sum)
- 7594
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7590
- Möbius Function
- 1
- Radical
- 15182
- 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
- yes
- Odd
- no
Appears in sequences
- Number of precomplete Post functions of n variables.at n=5A002826
- Expansion of 1/(1-x^3-x^4-x^5).at n=39A017818
- Decimal part of n-th root of a(n) starts with digit 9.at n=13A034086
- Number of compositions (ordered partitions) of n into 1's, 2's and 4's.at n=18A060945
- Expansion of (1-x)^(-1)/(1+2*x+x^2+x^3).at n=18A077930
- a(n) = sum of the first n lower twin primes.at n=37A086167
- The PDO(n) function (Partitions with Designated summands in which all parts are Odd): the sum of products of multiplicities of parts in all partitions of n into odd parts.at n=37A102186
- Expansion of 1/(1 - x^3 - x^4 + x^7 - x^10 - x^11 + x^14) (a Salem polynomial).at n=60A143644
- a(j) = maximum value of n for each distinct increasing value of (Sum of the quadratic non-residues of prime(n) - Sum of the quadratic residues of prime(n)) / prime(n) for each j.at n=15A166263
- Integers whose binary digits "1" define, if sorted into a quadrant shape whose right angle lies in a Go board corner, same colored Go stones that surely live all, but not if any stone is omitted.at n=31A166537
- a(0) = 0, a(1) = 1, a(2) = 1, a(3) = 2; a(n) = a(n-1) + a(n-2) + a(n-4).at n=19A181532
- Number of n X 3 arrays with each row a permutation of 1..3 having at least as many downsteps as the preceding row, with rows in lexicographically nonincreasing order.at n=42A222001
- The number of all possible covers of L-length line segment by 3-length line segments with allowed gaps < 3.at n=36A228362
- Expansion of (1-x-x^2)/((x-1)*(x^3+3*x^2+2*x-1)).at n=9A238236
- a(n) = n*F(n+1) - (n+1)*F(n), where F = A000045.at n=17A264147
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 337", based on the 5-celled von Neumann neighborhood.at n=27A271287
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 566", based on the 5-celled von Neumann neighborhood.at n=33A272989
- Solution of the complementary equation a(n) = 2*a(n-1) - a(n-2) + b(n-1), where a(0) = 1, a(1) = 2, b(0) = 3, and (a(n)) and (b(n)) are increasing complementary sequences.at n=41A294866
- a(1) = number of 1-digit primes (that is, 4: 2,3,5,7); then a(n) = number of distinct n-digit prime numbers obtained by left- or right-concatenating a digit to the a(n-1) primes obtained in the previous iteration.at n=11A298048
- a(n) = 8*n^2 - 7*n + 2.at n=44A360417