14434
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 24768
- Proper Divisor Sum (Aliquot Sum)
- 10334
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6180
- Möbius Function
- -1
- Radical
- 14434
- 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
- 45
- 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
- Convolution of natural numbers with Beatty sequence for the golden mean A000201.at n=36A023541
- Numbers k such that 37*2^k+1 is prime.at n=30A032368
- The number of partitions of {1..7n} that are invariant under a permutation consisting of n 7-cycles.at n=5A036077
- Interprimes which are of the form s*prime, s=14.at n=23A075289
- Numbers k such that binomial(5k, k) + 1 is prime.at n=13A125243
- Integers k such that 10^k + 79 is a prime number.at n=24A135131
- Number of Dyck paths with no UUU's and no DDD's, of semilength n and having no UDUD's (U=(1,1), D=(1,-1)).at n=20A166289
- Number of 6-step one space for components leftwards or up, two space for components rightwards or down asymmetric quasi-bishop's tours (antidiagonal moves become knight moves) on an n X n board summed over all starting positions.at n=9A187610
- (1/2)*A206803.at n=32A206804
- Number of (n+2)X(2+2) 0..3 arrays with every 3X3 subblock row and column sum prime and every diagonal and antidiagonal sum nonprime.at n=6A251944
- Number of (n+2)X(7+2) 0..3 arrays with every 3X3 subblock row and column sum prime and every diagonal and antidiagonal sum nonprime.at n=1A251949
- T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row and column sum prime and every diagonal and antidiagonal sum nonprime.at n=29A251950
- T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row and column sum prime and every diagonal and antidiagonal sum nonprime.at n=34A251950
- Number of n-length words on {0,1,2,3} avoiding runs of zeros of length 1 (mod 3).at n=8A255631
- Expansion of Product_{k>=1} (1+x^k)^(k*(k-1)).at n=13A258344
- Expansion of e.g.f. sec(x*exp(x)).at n=7A294312
- The list of all prime numbers is split into sublists with the 1st sublist L_1 = {2} and n-th sublist L_n = {p_1, p_2, ..., p_m}. a(n) is the largest m such that the maximum prime gap in L_n is < p_1 - prevprime(p_1).at n=36A348178
- Number of 2-color vertex orderings of the labeled path graph on n vertices.at n=7A360516
- a(n) = Sum_{k=0..floor(n/2)} (-1)^k * binomial(2*n-2*k-3,n-2*k).at n=10A390680