14358
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 28728
- Proper Divisor Sum (Aliquot Sum)
- 14370
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 4784
- Möbius Function
- -1
- Radical
- 14358
- 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
- 120
- 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
- a(n) = Sum_{d|n} (2^d*3^(n/d)).at n=7A038039
- Inverse Moebius transform of A001371 (starting at term 0).at n=19A054158
- Average of 4 primes where the integer Schwarzian derivative is zero.at n=18A094903
- a(1) = 1, a(n) = n+a(n-1) if n does not divide a(n-1), else a(n) = n*a(n-1).at n=30A095234
- Prime index of A000101(n), maximal gap upper end prime index.at n=14A107578
- Indices of primes occurring in A031134.at n=21A122413
- Number of ways to place zero or more nonadjacent 0,0 1,0 1,1 2,0 3,0 4,0 4,1 polyhexes in any orientation on a planar nXnXn triangular grid.at n=7A155320
- Number of primes <= A214757(n).at n=14A214925
- G.f.: A(x) = exp( Sum_{n>=1} 3^n * x^n/(n*(1+x^n)) ).at n=9A259273
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 401", based on the 5-celled von Neumann neighborhood.at n=27A271805
- Number of factorizations of m^n into exactly seven factors, where m is a product of two distinct primes.at n=9A277243
- a(n) is the number of connected transitive relations over n unlabeled nodes.at n=6A296105
- Integers that concatenate 3 counts: the number of terms in the sequence so far, the number of primes in the sequence so far, the number of digits in the sequence so far, with a(1)= 113. The sequence is always extended with the smallest available integer not leading to a contradiction or a dead end.at n=13A309617
- Number of 4-element subsets of [n] whose sum is a triangular number.at n=44A320850
- a(n) is the index k of prime(k), such that abs(prime(k) - Sum_{j=k-2..k+2} prime(j)/5) sets a new record.at n=19A337438
- a(n) is the index k of prime(k), such that abs(prime(k) - Sum_{j=k-1..k+1} prime(j)/3) sets a new record.at n=12A337488
- Numbers k such that 85*10^k+1 is prime.at n=8A376910