15008
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 34272
- Proper Divisor Sum (Aliquot Sum)
- 19264
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6336
- Möbius Function
- 0
- Radical
- 938
- Omega Function (Ω)
- 7
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 27
- 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
- Expansion of e.g.f.: cosh(arctan(x)*log(x+1))=1+12/4!*x^4-60/5!*x^5+90/6!*x^6-420/7!*x^7...at n=8A012405
- Numbers k such that k | sigma_11(k).at n=30A055715
- Triangle, read by rows, where the n-th row lists the (2n+1) coefficients of (1+2x+2x^2)^n.at n=58A084606
- Each term k provides a value of (sum-of-digits of 5^k)/k that is closer to Pi than the previous value.at n=13A119666
- a(n) is the number of numbers removed in each step of Eratosthenes's sieve for 10!.at n=11A145537
- Number of binary strings of length n with equal numbers of 00011 and 01001 substrings.at n=15A164230
- E.g.f. A(x) = Sum_{n>0} a(n)*x^n/n! is the inverse function to exp(2*x)-x-1.at n=4A205671
- Number of (w,x,y) with all terms in {0,...,n} and 2|w-x| >= max(w,x,y)-min(w,x,y).at n=27A213388
- Number of (n+1) X (1+1) 0..5 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 4 (constant-stress 1 X 1 tilings).at n=3A234651
- Number of (n+1) X (4+1) 0..5 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 4 (constant-stress 1 X 1 tilings).at n=0A234654
- T(n,k) is the number of (n+1) X (k+1) 0..5 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 4 (constant-stress 1 X 1 tilings).at n=6A234658
- T(n,k) is the number of (n+1) X (k+1) 0..5 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 4 (constant-stress 1 X 1 tilings).at n=9A234658
- a(n) = 4*n*(21*n - 26).at n=14A263229
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 43", based on the 5-celled von Neumann neighborhood.at n=27A269878
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 163", based on the 5-celled von Neumann neighborhood.at n=27A270455
- Number of subsets of {2..n} containing the product of any set of distinct elements whose product is <= n.at n=15A308542
- Number of bicolored acyclic graphs on n unlabeled nodes.at n=13A329053
- Number of ways to write n as an ordered sum of eight powers of 2.at n=45A342251
- Number of partitions of n such that 5*(smallest part) = (number of parts).at n=59A350897
- Positions k such that A097465(k) and A097465(k+1) are odd.at n=9A353069