12191
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 12432
- Proper Divisor Sum (Aliquot Sum)
- 241
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 11952
- Möbius Function
- 1
- Radical
- 12191
- 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
- 187
- 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
- a(n) = Sum_{d|n} sigma(n/d)*d^3.at n=22A027847
- Smallest k>n such that n^3+1 divides k*n^2+1.at n=23A071568
- Cycle of the inventory sequence (as in A063850) starting with n consists of prime numbers.at n=42A078970
- Numbers k such that 11k = 6j^2 + 6j + 1.at n=27A106388
- Row sums of triangle A131424.at n=43A131425
- a(n) = 15*n*(n+1) + 11.at n=28A132208
- The sum of the elements in the first, middle and last row of the n-th power of the 9-by-9 matrix defined in the formula.at n=7A134326
- Number of n X n binary arrays symmetric about main diagonal with all ones connected only in an em 1,1 1,2 2,2 2,3 3,3 in any orientation.at n=8A146147
- Number of n X n binary arrays symmetric about the diagonal and under 90 degree rotation with all ones connected only in an em 1,1 1,2 2,2 2,3 3,3 in any orientation.at n=18A146149
- Number of n X n binary arrays symmetric about the diagonal and under 90 degree rotation with all ones connected only in an em 1,1 1,2 2,2 2,3 3,3 in any orientation.at n=19A146149
- a(n) = a(n-1) + 10*a(n-3) for n > 2; a(0) = a(1) = a(2) = 1.at n=11A178205
- a(n) = prime(n)^3 + prime(n) + 1.at n=8A181150
- Odd composite numbers n, such that n, n+d, n*d and n/d are all odious (A000069) for every divisor d of n.at n=24A231558
- Coordination sequence for (2,5,6) tiling of hyperbolic plane.at n=22A265065
- a(n) = Sum_{k=0..n} (-1)^(k+1) * k * A000041(n-k).at n=42A270143
- Numbers k such that (82*10^k + 161)/9 is prime.at n=24A271505
- Number of nX5 0..1 arrays with no element unequal to a strict majority of its horizontal, diagonal and antidiagonal neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards.at n=4A281762
- T(n,k)=Number of nXk 0..1 arrays with no element unequal to a strict majority of its horizontal, diagonal and antidiagonal neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards.at n=40A281765
- Number of 5Xn 0..1 arrays with no element unequal to a strict majority of its horizontal, diagonal and antidiagonal neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards.at n=4A281769
- Number of unlabeled connected graphs with n nodes of degree 4 or less, excluding 4-regular graphs.at n=8A287424