15578
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 26
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 23370
- Proper Divisor Sum (Aliquot Sum)
- 7792
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7788
- Möbius Function
- 1
- Radical
- 15578
- 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
- 84
- 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
- yes
- Odd
- no
Appears in sequences
- Number of subsets of {1,2,...,n} that contain the average of their elements.at n=17A065795
- Difference between the arithmetic mean of the neighbors of the terms and the term itself follows the pattern 0,1,2,3,4,5,...at n=37A086514
- Number of configurations of the sliding block 8-puzzle that require a minimum of n moves to be reached, starting with the empty square in one of the corners.at n=25A089473
- Number of nX7 arrays of the minimum value of corresponding elements and their horizontal or antidiagonal neighbors in a random 0..1 nX7 array.at n=2A218063
- T(n,k) = Number of n X k arrays of the minimum value of corresponding elements and their horizontal or antidiagonal neighbors in a random 0..1 n X k array.at n=38A218064
- Number of 3Xn arrays of the minimum value of corresponding elements and their horizontal or antidiagonal neighbors in a random 0..1 3Xn array.at n=6A218066
- Number of 2 X n arrays of the minimum value of corresponding elements and their horizontal or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and columns, 0..2 2 X n array.at n=19A219628
- Number of partitions p of n such that median(p) < mean(p).at n=35A240217
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 461", based on the 5-celled von Neumann neighborhood.at n=27A272293
- Array read by antidiagonals: A(n,k) is the number of unsensed planar maps with n vertices and k faces, n >= 1, k >= 1.at n=39A277741
- Array read by antidiagonals: A(n,k) is the number of unsensed planar maps with n vertices and k faces, n >= 1, k >= 1.at n=41A277741
- 5-untouchable numbers.at n=40A284187
- Take a squarefree semiprime and take the difference of its prime factors. If it is a squarefree semiprime repeat the process. Sequence lists the squarefree semiprimes that generate other squarefree semiprimes only in the first k steps of this process. Case k = 4.at n=31A296811
- G.f.: Sum_{k>=1} x^k/(1-x^k) * Product_{k>=1} (1+x^k).at n=38A305082