15414
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 35328
- Proper Divisor Sum (Aliquot Sum)
- 19914
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4392
- Möbius Function
- 1
- Radical
- 15414
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 4
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
- 71
- 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) = [ 2nd elementary symmetric function of {sqrt(k)} ], k = 1,2,...,n.at n=39A025193
- Smallest index i such that next_prime( 2*prime(i) ) - 2*prime(i) = 2n - 1.at n=40A074973
- a(1)=1, a(2)=2; for n >= 2, a(n+1) = a(n) + sum of prime factors of a(n).at n=31A096461
- Number of distinct products i*j*k*l for 1 <= i < j < k < l <= n.at n=38A100438
- Indices of primes in the sequence defined by A(0) = 29, A(n) = 10*A(n-1) - 71 for n > 0.at n=8A101955
- Inverse binomial transform of A006116, which is the sum of Gaussian binomial coefficients [n,k] for q=2.at n=7A135922
- Number of n X n binary arrays symmetric about both diagonal and antidiagonal with all ones connected only in a 1001-1111-1001 pattern in any orientation.at n=21A146929
- G.f. satisfies: A(x) = -1/(1+x) + A(x)^2 + 1/A(x)^2.at n=6A228923
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 5", based on the 5-celled von Neumann neighborhood.at n=27A270008
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 5", based on the 5-celled von Neumann neighborhood.at n=28A270008
- Alternating sum of centered octagonal pyramidal numbers.at n=28A270695
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 261", based on the 5-celled von Neumann neighborhood.at n=27A271062
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 469", based on the 5-celled von Neumann neighborhood.at n=27A272418
- Number of unlabeled forests with n nodes that have two components, neither of which is the empty graph.at n=16A274938
- Numbers k such that (22*10^k + 53)/3 is prime.at n=20A286431
- Number of non-averaging permutations of [n] with first element n.at n=18A296530
- Erroneous version of: Number of Stanley graphs on n nodes.at n=6A323841
- Coefficients of polynomials related to the sum of Gaussian binomial coefficients for q = 2. Triangle read by rows, T(n,k) for 0 <= k <= n.at n=28A329154
- Irregular triangular array read by rows. T(n,k) is the number of unlabeled forests of distinct trees on n nodes containing exactly k trees.at n=47A336096
- a(n) = Sum_{k=0..n} 2^(n - k)*Pochhammer(k/2, n - k). Row sums of A370419(n - k, k).at n=7A370982