15606
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 36840
- Proper Divisor Sum (Aliquot Sum)
- 21234
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4896
- Möbius Function
- 0
- Radical
- 102
- Omega Function (Ω)
- 6
- 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
- 146
- 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
- Multiplicity of highest weight (or singular) vectors associated with character chi_180 of Monster module.at n=39A034568
- Numbers whose base-7 representation contains exactly four 3's.at n=29A043408
- Numbers k such that sopfr(k) = sopfr(k - sopfr(k)).at n=22A050781
- (Sum of digits of n)^6 - (sum of digits of n^6).at n=5A069980
- Number of permutations of 6 indistinguishable copies of 1..n with exactly 2 adjacent element pairs in decreasing order.at n=2A151651
- Triangle in which the g.f. for row n is [Sum_{k>=0} C(n+k-1,k)^3*x^k]*(1-x)^(3n+1), read by rows of k=0..2n terms.at n=38A181544
- Triangle in which the g.f. for row n is [Sum_{k>=0} C(n+k-1,k)^3*x^k]*(1-x)^(3n+1), read by rows of k=0..2n terms.at n=46A181544
- Central coefficients of the Riordan matrix (1/(1-3*x^2),x/(1-x)) (A191582).at n=8A191585
- The number of functions f:{1,2,...,n}->{1,2,...,n} that have an odd number of odd length cycles and no even length cycles.at n=6A202013
- Number of (n+2) X 3 binary arrays avoiding patterns 001 and 101 in rows and columns.at n=14A202195
- Number of (w,x,y) with all terms in {0,...,n} and 2*max(w,x,y) > 3*min(w,x,y).at n=25A213393
- Pairs of Pythagorean numbers differing by 6.at n=33A228875
- Upper Pythagorean twins.at n=16A228877
- Irregular triangle read by rows: T(n,k) = Sum_{i=0..k} (-1)^i * binomial(6*n+1,i) * binomial(k+6-i,6)^n, 0 <= k <= 6*(n-1).at n=10A237252
- Irregular triangle read by rows: T(n,k) = Sum_{i=0..k} (-1)^i * binomial(6*n+1,i) * binomial(k+6-i,6)^n, 0 <= k <= 6*(n-1).at n=18A237252
- Sum over all partitions lambda of n into 5 distinct parts of Product_{i:lambda} prime(i).at n=3A258360
- Differences of the increasing arithmetic progression a^2+a, b^2+b, c^2+c, where b = 5*a+2, c = 7*a+3 and a >= 0.at n=25A260955
- Number of 2 X 2 planar subsets in an n X n X n cube.at n=18A270205
- Sum of the largest parts of the partitions of n into 8 squarefree parts.at n=44A326452
- a(n) = lcm(tau(n), sigma(n), pod(n)) / gcd(tau(n), sigma(n), pod(n)) where tau(k) is the number of divisors of k (A000005), sigma(k) is the sum of divisors of k (A000203) and pod(k) is the product of divisors of k (A007955).at n=33A329929