14191
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 14832
- Proper Divisor Sum (Aliquot Sum)
- 641
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 13552
- Möbius Function
- 1
- Radical
- 14191
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 102
- 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) = n*(7*n^2 - 1)/6.at n=23A004126
- Pseudoprimes to base 31.at n=41A020159
- Strong pseudoprimes to base 31.at n=10A020257
- Number of partitions satisfying 0 < cn(2,5) + cn(3,5).at n=35A039897
- a(n) = n*(n^2 - 6*n + 11)/6.at n=46A050407
- Coefficients in expansion of Sum_{n >= 1} x^n/(1-x^n)^4.at n=43A059358
- Permutation of N induced by rotating the node 6 right in the infinite planar binary tree shown at A065658.at n=49A065670
- Centered 15-gonal numbers: a(n) = (15*n^2 - 15*n + 2)/2.at n=43A069128
- Integer part of the area of consecutive prime sided tetragons with one right angle.at n=29A105270
- Minimum over all permutations b of 1..n of sum b(i)*b^{-1}(i).at n=42A118375
- Number of distinct values taken by the entropy for permutations of [1..n], where the entropy of a permutation pi is Sum_{k=1..n} (pi(k)-k)^2.at n=44A126972
- Let A(0) = 1, B(0) = 0 and C(0) = 0. Let A(n+1) = - Sum_{k = 0..n} binomial(n,k)*C(k), B(n+1) = Sum_{k = 0..n} binomial(n,k)*A(k) and C(n+1) = Sum_{k = 0..n} binomial(n,k)*B(k). This entry gives the sequence B(n).at n=12A143631
- Ulam's spiral (ESE spoke).at n=30A143855
- Number of n X n binary arrays symmetric under 180 degree rotation with all ones connected only in a 101-111-101 pattern in any orientation.at n=11A146436
- Numbers k that are the products of two distinct primes such that 2*k-1, 4*k-3, 8*k-7, 16*k-15 and 32*k-31 are also products of two distinct primes.at n=23A177214
- Numbers k that are the products of two distinct primes such that 2*k-1, 4*k-3, 8*k-7, 16*k-15, 32*k-31 and 64*k-63 are also products of two distinct primes.at n=9A177215
- Record values in A180076.at n=38A180080
- E.g.f.: Sum_{n>=0} (1+x)^(n^2)*x^n/n!.at n=6A183604
- Numbers n > 1 such that the sum of the distinct prime divisors of n^2 + 1 that are congruent to 1 mod 8 equals the sum of the distinct prime divisors congruent to 5 mod 8.at n=5A215950
- Number of n X 2 nonnegative integer arrays with upper left 0 and every value within 2 of its city block distance from the upper left and every value increasing by 0 or 1 with every step right or down.at n=21A252814