12196
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 21350
- Proper Divisor Sum (Aliquot Sum)
- 9154
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6096
- Möbius Function
- 0
- Radical
- 6098
- Omega Function (Ω)
- 3
- 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
- 125
- 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
- yes
- Odd
- no
Appears in sequences
- Number of hexagonal n-element polyominoes whose graph is a path.at n=11A003104
- Number of permutations that are 2 "block reversals" away from 12...n.at n=14A007972
- Numbers n such that n is a substring of its square in base 5 (written in base 10).at n=15A018829
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 60 ones.at n=32A031828
- Expansion of Sum_{n>=0} (q^n / Product_{k=1..n+4} (1 - q^k)).at n=30A035300
- Denominators of continued fraction convergents to sqrt(934).at n=10A042807
- Number of permutations of length n which avoid the patterns 123, 3241.at n=12A116702
- Lesser of twin simili-primes of order 2.at n=43A126699
- Triangle read by rows: A007318^(-1) * A011971.at n=42A136789
- Duplicate of A003104.at n=11A151516
- Number of ways to place zero or more nonadjacent 0,0 1,0 2,1 3,1 4,1 5,0 5,1 6,0 polyhexes in any orientation on a planar nXnXn triangular grid.at n=7A155418
- Number of strings of numbers x(i=1..6) in 0..n with sum i*x(i)^3 equal to 6*n^3.at n=43A184723
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 211", based on the 5-celled von Neumann neighborhood.at n=26A270899
- a(n) = 4*n^3 - 18*n^2 + 27*n - 12.at n=15A271828
- Sum_{n>=0} a(n) * x^n / (n!)^2 = 1 / BesselJ(0,2*sqrt(x))^4.at n=4A336639
- a(n) = (n!)^2 * [x^n] 1 / BesselJ(0,2*sqrt(x))^n.at n=4A336665
- Square array read by descending antidiagonals. T(n,k) is the number of ways to separate the columns of an ordered pair of n-permutations (that have been written as a 2 X n array, one atop the other) into k cells so that no cell has a column rise. For n >= 0, k >= 0.at n=40A340986