15239
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 17784
- Proper Divisor Sum (Aliquot Sum)
- 2545
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 13020
- Möbius Function
- 0
- Radical
- 2177
- Omega Function (Ω)
- 3
- 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
- 177
- 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
- no
- Odd
- yes
Appears in sequences
- Numbers k such that A055079(k) = 2^k.at n=34A057838
- Numbers of the form 49*k, where 49*k+2 and 49*k-6 are both prime.at n=7A153779
- Triangle T(n,m), [x*A(x)]^m=sum(n>=m T(n,m)*x^n), where A(x) satisfies x*A(x)^2= -(2*x*A(x)+sqrt(1-4*x*A(x))-1)/(4*x*A(x)+sqrt(1-4*x*A(x))-1).at n=31A188109
- Irregular array T(n,k) of the numbers of non-extendable (complete) non-self-adjacent simple paths ending at each of a minimal subset of nodes within a square lattice bounded by rectangles with nodal dimensions n and 5, n >= 2.at n=54A214359
- Irregular array T(n,k) of the numbers of non-extendable (complete) non-self-adjacent simple paths ending at each of a minimal subset of nodes within a square lattice bounded by rectangles with nodal dimensions n and 8, n >= 2.at n=23A214375
- Number of partitions p of n such that (maximal multiplicity over the parts of p) = (number of numbers in p having multiplicity > 1).at n=48A241132
- Number T(n,k) of inequivalent n X n matrices using exactly k different symbols, where equivalence means permutations of rows or columns or the symbol set; triangle T(n,k), n>=0, 0<=k<=n^2, read by rows.at n=21A242106
- Number of compositions of n with exactly three occurrences of the largest part.at n=16A243738
- G.f.: Product_{k>=1} 1/(1-x^k)^(2*k+3).at n=8A255802
- Number of length-n 0..6 arrays with no repeated value unequal to the previous repeated value plus one mod 6+1.at n=4A268942
- T(n,k)=Number of length-n 0..k arrays with no repeated value unequal to the previous repeated value plus one mod k+1.at n=49A268944
- Number of length-5 0..n arrays with no repeated value unequal to the previous repeated value plus one mod n+1.at n=5A268946
- Number of Baxter matrices of size 3 X n.at n=12A347673
- Least k such that there are exactly n ways to choose a sequence of divisors, one of each element of the multiset of prime indices of k (with multiplicity).at n=39A355732
- Triangle read by rows: T(n,k) is the number of simple graphs on n unlabeled nodes with degeneracy k, 0 <= k < n.at n=51A384849