12411
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 9
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 20592
- Proper Divisor Sum (Aliquot Sum)
- 8181
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7056
- Möbius Function
- 0
- Radical
- 4137
- Omega Function (Ω)
- 4
- 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
- yes
- Harshad Number
- yes
- Narcissistic Number
- no
- Collatz Steps
- 94
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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-x)(1-3x)(1-5x)(1-7x)).at n=4A021424
- Number of partitions of n into parts not a multiple of 7. Also number of partitions with at most 6 parts of size 1 and differences between parts at distance 9 are greater than 1.at n=36A035985
- Triangle of B-analogs of Stirling numbers of the second kind.at n=31A039755
- Triangle of B-analogs of Stirling numbers of 2nd kind.at n=32A039756
- Numerators of continued fraction convergents to sqrt(111).at n=8A041200
- Numerators of continued fraction convergents to sqrt(444).at n=2A041844
- Concatenation of n in base 2 up to base 10 and n in base 10 down to base 2 is prime, all numbers are interpreted as decimals.at n=4A054258
- Numbers whose product of decimal digits equals its sum of binary digits.at n=23A064003
- Expansion of (1+x^2)*(1+x^5)*(1+x^8)/((1-x)*(1-x^2)*(1-x^3)*(1-x^4)*(1-x^5)*(1-x^6)*(1-x^7)*(1-x^8)*(1-x^9)*(1-x^10)).at n=31A069950
- Numbers n of the form k + reverse(k) for exactly two k.at n=31A072040
- G.f.: ( x - 3*x^2 + 6*x^3 - 8*x^4 + 4*x^5 - x^7 ) / (1 - 4*x + 6*x^2 - 5*x^3 + 2*x^4 + x^5 - x^6 + x^7 ).at n=17A083839
- Iccanobirt prime indices (6 of 15): Indices of prime numbers in A102116.at n=11A102136
- a(n) = n-th prime * n-th nonprime.at n=44A127118
- Composite numbers whose product of digits is 8.at n=39A201056
- G.f.: A(x,y) = Sum_{n>=0} n!*x^n*y^n * Product_{k=1..n} (1+y + 2*k*x*y) / (1 + (1+y)*k*x + 2*k^2*x^2*y).at n=31A221987
- G.f.: A(x,y) = Sum_{n>=0} n!*x^n*y^n * Product_{k=1..n} (1+y + 2*k*x*y) / (1 + (1+y)*k*x + 2*k^2*x^2*y).at n=32A221987
- a(n) = [x^n] G(n,x) where G(n,x) is the n-th iteration of G(1,x) = x/(1-x+x^2), so that G(n,x) = G(n-1, G(1,x)) with G(0,x)=x.at n=6A242574
- Numbers n such that n*2^2203 - 1 is prime.at n=14A265503
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 339", based on the 5-celled von Neumann neighborhood.at n=26A271291
- Let a(0)=1. Then a(n) = sums of consecutive strings of positive integers of length 3*n, starting with the integer 2.at n=14A289721