14143
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 14144
- 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
- 14142
- Möbius Function
- -1
- Radical
- 14143
- 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
- 1664
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Primes that remain prime through 3 iterations of function f(x) = 8x + 5.at n=15A023293
- Upper prime of a record difference between it and the second prime before it.at n=14A031134
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 58 ones.at n=31A031826
- a(n) is root of square starting with digit 2: first term of runs.at n=7A035069
- Number of forests of rooted trees where n dollars are spent and an n-node tree costs 2n-1 dollars.at n=22A038000
- a(n) = a(1) + a(2) + ... + a(n-1) - a(m) for n >= 4, where m = 2*n - 3 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1, a(2) = 2, and a(3) = 4.at n=15A049912
- Fifth term of weak prime quintets: p(m-3)-p(m-4) < p(m-2)-p(m-3) < p(m-1)-p(m-2) < p(m)-p(m-1).at n=32A054827
- Primes of the form 6*k^2 + 6*k + 31.at n=41A060844
- Initial term in sequence of four consecutive primes whose consecutive differences have d-pattern = [6, 4, 6]; short d-string notation for pattern = [646].at n=20A078856
- Primes p such that 6p + 1 and (p-1)/6 are primes.at n=27A085957
- Smallest prime which occurs exactly n times in the sequence A086527.at n=21A086528
- (Sum of composites among next n numbers)-(sum of primes among next n numbers).at n=34A094338
- Smallest prime p with at least two non-overlapping occurrences of n in decimal representation of p.at n=13A103611
- Primes and their indices such that when their respective SOD's are both prime, the SOD of the index is the nextprime of the prime SOD.at n=21A117458
- Primes that are simultaneously of the forms 24i+7 and 7j+24.at n=35A137657
- Primes of the form 210k + 73.at n=35A140857
- Primes congruent to 43 mod 47.at n=39A142394
- Primes congruent to 45 mod 53.at n=31A142575
- Primes congruent to 42 mod 59.at n=31A142769
- Primes congruent to 52 mod 61.at n=25A142850