14351
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 14592
- 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
- 14112
- Möbius Function
- 1
- Radical
- 14351
- 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
- 76
- 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
- Divisors of 2^28 - 1.at n=29A003536
- Products of 2 successive primes.at n=29A006094
- Numbers k such that sopfr(k) = sopfr(k - sopfr(k)).at n=21A050781
- Numbers k such that Euler phi(k) / Carmichael lambda(k) = 14.at n=33A066696
- Numbers that are products of (at least two) consecutive primes.at n=41A097889
- Pseudoquadprimes: p+4 for primes p where p+4 divides p^(p+4) + 4 and p+4 is composite.at n=9A100875
- a(n) = round(10000*log(n/10)).at n=41A104077
- Expansion of (1 +3*x -x^2)/((1-x^2)*(1-2*x-x^2)); a Pellian-related sequence.at n=10A114688
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, 0, 1), (0, -1, 1), (0, 1, -1), (0, 1, 0), (1, 1, 1)}.at n=7A150874
- a(n) = (10*n+3)*(10*n+17).at n=11A152579
- Integer part of square root of n^5 = A000584(n).at n=45A155013
- The general form of the recurrences are the a(j), b(j) and n(j) solutions of the 2 equations problem: 11*n(j) + 1 = a(j)*a(j) and 13*n(j) + 1 = b(j)*b(j) with positive integer elements. the solutions of the 2 equations problem: 11*n(j) + 1 = a(j)*a(j); 13*n(j) + 1 = b(j)*b(j); with integer numbers.at n=3A159661
- Numbers k such that 2^(2k-1) == 2 (mod 2k) and such that 2^(k-1) != 1 (mod k).at n=27A176033
- G.f. satisfies A(x) = 1 + x*A(x)^4 - x^2*A(x)^5.at n=7A200754
- a(n) is the difference between multiples of 9 with even and odd digit sum in base 8 in interval [0,8^n).at n=6A212593
- a(n) = 1/15*(128*n^5 + 320*n^4 + 80*n^3 - 200*n^2 + 92*n - 15).at n=3A212670
- S_5 sequence in partition of integers > 1 described in A240521.at n=35A240522
- Number of ascent sequences of length n with the maximal number of descents.at n=24A241881
- Row products of table A244365.at n=28A245722
- Quasi-Carmichael numbers to exactly three bases.at n=9A257753