15412
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 26978
- Proper Divisor Sum (Aliquot Sum)
- 11566
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7704
- Möbius Function
- 0
- Radical
- 7706
- Omega Function (Ω)
- 3
- 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
- 53
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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
- Number of dyslexic planted planar trees with n+1 nodes where any 2 subtrees extending from the same node are different.at n=14A032065
- Number of n X n matrices over symbol set {1,2,3} equivalent under any permutation of row, columns or the symbol set.at n=4A091060
- Numbers n such that 15*prime(n)+{-4,-2,2,4} are all primes.at n=38A176002
- Number of nXnXn 0..6 triangular arrays with each element x equal to the number its neighbors equal to 5,3,5,1,5,0,0 for x=0,1,2,3,4,5,6.at n=5A197663
- Number A(n,k) of inequivalent n X n matrices with entries from [k], where equivalence means permutations of rows or columns or the symbol set; square array A(n,k), n>=0, k>=0, read by antidiagonals.at n=32A242095
- Numbers k such that k + (sum of digits of k) and k + (product of digits of k) contain the same distinct digits of k.at n=14A248718
- Number of n X 3 0..1 arrays with no element equal to more than one of its horizontal and vertical neighbors, with the exception of exactly two elements, and with new values introduced in order 0 sequentially upwards.at n=10A280549
- Decimal representation of the x-axis, from the left edge to the origin, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 438", based on the 5-celled von Neumann neighborhood.at n=13A282220
- Numbers k such that 405*2^k+1 is prime.at n=27A323102
- Numbers that are the sum of eight fourth powers in exactly seven ways.at n=35A345839
- Base-7 representation of A000422(n).at n=3A353115
- G.f. A(x,y) = Sum_{n>=0} x^n/(1-y)^(2*n+1) * Sum_{k=0..3*n} T(n,k)*y^k satisfies: y = Sum_{n=-oo..+oo} (-1)^n * x^(n*(n+1)/2) * A(x,y)^n.at n=46A355870
- a(n) is the numerator of (120*n^2 + 151*n + 47)/(512*n^4 + 1024*n^3 + 712*n^2 + 194*n + 15).at n=19A374580