14197
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 14198
- Proper Divisor Sum (Aliquot Sum)
- 1
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 14196
- Möbius Function
- -1
- Radical
- 14197
- Omega Function (Ω)
- 1
- Little Omega Function (ω)
- 1
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
- 58
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- yes
- Composite Number
- no
- Semiprime
- no
- Squarefree Number
- yes
- Prime Power
- yes
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 1670
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Perrin sequence (or Perrin numbers, or Ondrej Such sequence): a(n) = a(n-2) + a(n-3) with a(0) = 3, a(1) = 0, a(2) = 2.at n=34A001608
- a(n) = 4^n - 3^n.at n=7A005061
- Nexus numbers (n + 1)^7 - n^7.at n=3A022523
- Upper prime of a difference of 20 between consecutive primes.at n=30A031939
- Numbers whose base-4 representation contains exactly four 1's and three 3's.at n=28A045132
- Square array of nexus numbers a(n,k) = (n+1)^(k+1) - n^(k+1) (n >= 0, k >= 0) read by upwards antidiagonals.at n=51A047969
- Least prime in A031928 (lesser of 10-twins) whose distance to the next 10-twin is 6*n.at n=14A052354
- Primes of the form k(k+1)/2+1 (i.e., central polygonal numbers, or one more than triangular numbers).at n=43A055469
- Smallest prime p such that x = n is a solution mod p of x^3 = 2, or 0 if no such prime exists.at n=42A059940
- a(n) = n^p - (n-1)^p, where p is the n-th prime.at n=3A061028
- Number of n X 7 binary arrays with a path of adjacent 1's from top row to bottom row.at n=1A069382
- Prime numbers in the Perrin sequence b(n+1) = b(n-1) + b(n-2) with initial values b(1)=3, b(2)=0, b(3)=2.at n=9A074788
- Primes that are the difference between two powers: y^z - x^z = prime.at n=33A078668
- Primes p such that (3*p)^2 + p^2 + 3^2 and (3*p)^2 - p^2 - 3^2 are both prime.at n=37A079796
- G.f.: (2-x)/((1+3x)(1-4x)); e.g.f.: exp(4x) + exp(-3x); a(n) = 4^n + (-3)^n.at n=7A087452
- Least prime that begins a run of exactly 2n-1 primes between two consecutive prime-indexed primes.at n=11A088988
- Primes of the form 47*k + 3.at n=37A100494
- Expansion of ( 2+x+2*x^2 ) / ( 1-2*x+x^2-x^3 ).at n=15A109377
- Triangle read by rows: row n lists first n noncomposite numbers, starting with 1, in increasing order, whose sum is A113495(n).at n=64A113759
- Triangle read by rows: row n lists first n noncomposite numbers, starting with 1, in increasing order, whose sum is A113495(n).at n=54A113759