15828
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 36960
- Proper Divisor Sum (Aliquot Sum)
- 21132
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5272
- Möbius Function
- 0
- Radical
- 7914
- Omega Function (Ω)
- 4
- 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
- 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
- An approximation to population of x^2 + y^2 <= 2^n.at n=16A000692
- First differences of A087235.at n=6A087240
- Expansion of x*(x^3+2*x^2+3*x-1)/(x+1)^5.at n=18A119515
- Indices k such that A020503(k)=Phi[k](-4) is prime, where Phi is a cyclotomic polynomial.at n=42A138926
- Indices k such that A019322(k) = Phi[k](4) is prime, where Phi is a cyclotomic polynomial.at n=44A138934
- Triangle read by rows: T(n,k) is the number of white corners of rank k in all the permutations of {1,2,...,n} (n>=2, 0<=k<=n-2; for definitions see the Eriksson-Linusson references).at n=24A140713
- Number of n X n binary arrays symmetric about both diagonal and antidiagonal with all ones connected only in a 00100-00100-11111-00100 pattern in any orientation.at n=19A147329
- Number of binary strings of length n with equal numbers of 00001 and 11010 substrings.at n=15A164209
- Triangle read by rows: T(n,k) (n>=1, 1 <= k <= n) = number of n-element unlabeled rigid interval posets of height k.at n=74A193357
- Numbers n such that n^32+1 and (n+2)^32+1 are both prime.at n=9A217992
- Triangle, read by rows, T(n,k) = t(n-k, k) where t(n,m) = f(m)*t(n-1,m) + f(n)*t(n,m-1), and f(x) = x + 3.at n=22A257180
- Triangle, read by rows, T(n,k) = t(n-k, k) where t(n,m) = f(m)*t(n-1,m) + f(n)*t(n,m-1), and f(x) = x + 3.at n=26A257180
- Coefficient of y^0 in G(x,y)^4 where G(x,y) = Sum_{n=-oo..+oo} (1-x^n)^n * x^n * y^n.at n=26A263189
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 229", based on the 5-celled von Neumann neighborhood.at n=27A270948
- a(n) is the end square spiral number for a knight starting on square n moving on a board with squares numbered with the square of their distance from the 0-square origin and where the knight moves to the smallest numbered unvisited square; the smallest spiral number ordering is used if the distances are equal.at n=25A326931