15171
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 21840
- Proper Divisor Sum (Aliquot Sum)
- 6669
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9312
- Möbius Function
- -1
- Radical
- 15171
- 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
- 133
- 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
- no
- Odd
- yes
Appears in sequences
- Numbers that are the sum of 11 positive 8th powers.at n=31A003389
- Numbers whose base-5 representation contains exactly three 1's and three 4's.at n=17A045262
- Sum{k=1 to n} H(k) k!, where H(k) = sum{j=1 to k} 1/j.at n=7A097422
- Number of partitions of the n-th minimal number into distinct minimal numbers.at n=30A099388
- Theorems from propositional calculus, translated into decimal digits.at n=20A101273
- This table (read by rows) shows the coefficients of sum formulas of n-th subfactorial numbers (A000166). The n-th row (n>=1) contains T(i,n) for i=1 to n, where T(i,n) satisfies Subf(n) = Sum_{i=1..n} T(i,n) * n^(n-i).at n=34A101559
- A Whitney transform of the central binomial coefficients A000984.at n=7A103821
- Rectangular table, read by antidiagonals, defined by the following rule: start with all 1's in row zero; from then on, row n+1 equals the partial sums of row n excluding terms in columns k = m*(m+1)/2 (m>=1).at n=48A127054
- Number of tilings of a 4 X n rectangle using dominoes and right trominoes.at n=6A165791
- Numbers n such that 41#*2^n-1 is prime, where # denotes the primorial, A002110.at n=73A176061
- Number A(n,k) of tilings of a k X n rectangle using dominoes and right trominoes; square array A(n,k), n>=0, k>=0, read by antidiagonals.at n=59A219987
- Number A(n,k) of tilings of a k X n rectangle using dominoes and right trominoes; square array A(n,k), n>=0, k>=0, read by antidiagonals.at n=61A219987
- Number of tilings of a 6 X n rectangle using dominoes and right trominoes.at n=4A219989
- Total number of parts of multiplicity 9 in all partitions of n.at n=43A222709
- Number of balanced ternary words of length n.at n=24A260938
- Number of 7Xn arrays containing n copies of 0..7-1 with every element equal to or 1 greater than any northeast or northwest neighbors modulo 7 and the upper left element equal to 0.at n=4A267026
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 305", based on the 5-celled von Neumann neighborhood.at n=28A271162
- Coinage sequence: a(n) = A018227(n)-7.at n=41A272000
- Number of n X n 0..1 arrays with every element equal to 0, 1, 2, 4, 5, 6, 7 or 8 king-move adjacent elements, with upper left element zero.at n=4A300308
- Number of nX5 0..1 arrays with every element equal to 0, 1, 2, 4, 5, 6, 7 or 8 king-move adjacent elements, with upper left element zero.at n=4A300311