15002
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 8
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 24276
- Proper Divisor Sum (Aliquot Sum)
- 9274
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6912
- Möbius Function
- -1
- Radical
- 15002
- Omega Function (Ω)
- 3
- 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
- 177
- 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(0) = 1, a(n) = 24*n^2 + 2 for n>0.at n=25A010014
- Numbers ending with '2' that are the difference of two positive cubes.at n=35A038857
- Numbers k such that binomial(2k,k)+1 is prime.at n=37A066699
- a(n) = 4394*n + 1820.at n=3A156636
- Number of partitions of n containing a clique of size 9.at n=43A183566
- Number of nondecreasing arrangements of 8 numbers x(i) in -(n+6)..(n+6) with the sum of sign(x(i))*2^|x(i)| zero.at n=8A187992
- a(n) = n*(5n^2 + 3n + 4) / 6.at n=26A203551
- Number of nontrivially compound perfect squared rectangles of order n up to symmetries of the rectangle and its subrectangles.at n=18A217152
- Number of nonnegative integer arrays of length n summing to n without equal adjacent values modulo 5.at n=11A221318
- Triangle read by rows: T(n,k) gives the number of ballot sequences of length n having exactly k descents, n>=0, 0<=k<=n.at n=69A238121
- Irregular triangle read by rows: T(n,k) gives the number of ballot sequences of length n having k descents, n>=0, 0<=k<=A083920(n-1).at n=39A238122
- Number of ballot sequences of length n having exactly three descents.at n=5A241796
- Number T(n,k) of tilings of a 5 X n rectangle with pentominoes of any shape and exactly k pentominoes of shape Z; triangle T(n,k), n>=0, read by rows.at n=34A247713
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 94", based on the 5-celled von Neumann neighborhood.at n=36A270135
- a(n) is the number of unlabeled 2-connected graphs with n edges containing at least one pair of nodes with resistance distance 1 when all edges are replaced by unit resistors.at n=12A360031
- Expansion of e.g.f. 1/( exp(-x) - x )^2.at n=5A379933