14111
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 8
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 14352
- 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
- 13872
- Möbius Function
- 1
- Radical
- 14111
- 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
- 107
- 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
- Squares written in base 5.at n=34A001740
- a(n+6) = -a(n+5) + a(n+4) + 3a(n+3) + a(n+2) - a(n+1) - a(n). a(n) = sign(n) if abs(n)<=3.at n=34A001945
- Pseudoprimes to base 14.at n=39A020142
- Pseudoprimes to base 72.at n=36A020200
- Strong pseudoprimes to base 22.at n=9A020248
- Strong pseudoprimes to base 34.at n=11A020260
- Strong pseudoprimes to base 72.at n=12A020298
- Numbers whose set of base-10 digits is {1,4}.at n=38A032822
- a(n) = (3*n+1)*(4*n+1).at n=34A033577
- a(n) = prime(n)*prime(n+1) - prime(n) - prime(n+1).at n=29A037165
- Numbers k such that sopfr(k) = sopfr(k + sopfr(k)).at n=21A050780
- Least number k such that phi(k) / Carmichael lambda(k) = 2n.at n=16A066497
- Numbers k such that Euler phi(k) / Carmichael lambda(k) = 34.at n=0A066698
- Numbers k such that the "inventory" A063850 of k is a palindrome.at n=14A079466
- Near-repunit semiprimes.at n=30A105993
- Triangle T(n,k) = 2*binomial(n,k)^2 - 1, read by rows, 0<=k<=n.at n=51A141597
- Triangle T(n,k) = 2*binomial(n,k)^2 - 1, read by rows, 0<=k<=n.at n=48A141597
- a(n) = 18*n^2 - 1.at n=27A157910
- a(n) = 8*n^2 - 1.at n=41A157914
- a(n) = 392*n - 1.at n=35A158004