14282
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 22116
- Proper Divisor Sum (Aliquot Sum)
- 7834
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6912
- Möbius Function
- -1
- Radical
- 14282
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 3
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
- 32
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- yes
- Odd
- no
Appears in sequences
- Coordination sequence for MgZn2, Position Zn1.at n=30A009937
- Apply partial sum operator thrice to Catalan numbers.at n=9A014151
- Numbers k such that A065608(k) = A065608(k+1).at n=6A065062
- Numbers k such that (k+1)*phi(k) is a perfect square.at n=18A069952
- Triangle read by rows: number of Dyck paths of semilength n with k peaks before the first return (1<= k <n).at n=57A101974
- a(n) = 529*n - 1.at n=26A158365
- Riordan array ( (1/(1-x))^m , x*A000108(x) ), m = 3.at n=56A185944
- Smallest even number k such that lpf(k-3) = prime(n) while lpf(k-1) > lpf(k-3), where lpf=least prime factor (A020639).at n=27A242490
- Number of partitions of n with difference -1 between the number of odd parts and the number of even parts, both counted without multiplicity.at n=43A242691
- Smallest even k such that the pair {k-3,k-1} is not a twin prime pair and lpf(k-1) > lpf(k-3) >= prime(n), where lpf = least prime factor (A020639).at n=27A242720
- Least even k such that sfdf(k-1) > sfdf(k-3) >= A050376(n), where sfdf(n) is the smallest Fermi-Dirac factor of n (A223490), and k-3 is not the lesser of a pair of Fermi-Dirac twin primes (A229064).at n=33A244412
- Numbers n such that floor(antisigma(n) / sigma(n)) = floor(antisigma(n+1) / sigma(n+1)).at n=13A244666
- Numbers n such that the decimal equivalent of the binary reflected Gray code representation of n is a palindromic prime.at n=36A281382
- Numbers m such that the delta(m) = abs(sigma(m+1)/(m+1) - sigma(m)/(m)) is smaller than delta(k) for all k < m.at n=15A335071