15202
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 10
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 24912
- Proper Divisor Sum (Aliquot Sum)
- 9710
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6900
- Möbius Function
- -1
- Radical
- 15202
- 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
- 32
- 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
- Expansion of x^2*(2 - x + x^2) / ((1 + x)*(1 - x)^4).at n=43A026035
- a(n) = Sum_{k=0..n-2} T(n,k) * T(n,k+2), with T given by A026714.at n=5A027203
- Multiplicity of highest weight (or singular) vectors associated with character chi_33 of Monster module.at n=38A034421
- Number of partitions satisfying cn(1,5) < cn(2,5) + cn(3,5) and cn(4,5) < cn(2,5) + cn(3,5).at n=39A039888
- Thickened pyramidal numbers: a(n) = 2*(n+1)*n + Sum_{i=1..n} (4*i*(i-1) + 1).at n=22A050533
- McKay-Thompson series of class 40C for Monster.at n=49A058664
- Number of Catalan knight paths from (0,0) to (n,3) in the region between and on the lines y=0 and y=3. (See A096587 for the definition of Catalan knight.).at n=19A099331
- Number of base 16 circular n-digit numbers with adjacent digits differing by 6 or less.at n=4A125404
- a(1)=1, a(n)=a(n-1)+n^0 if n odd, a(n)=a(n-1)+ n^2 if n is even.at n=43A135301
- The number of 2 X 2 matrices with no real eigenvalues and whose entries are integers of absolute value at most n.at n=6A207259
- a(n) = 2^n - A000031(n).at n=14A209970
- Number of partitions of n such that (greatest part) - (least part) > number of parts.at n=39A237833
- a(n) is the period of the oscillating pattern formed by a diagonal line of 2*n cells in the Life-like cellular automaton B2e3ijkn4cz5/S236.at n=48A323382