15335
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 18408
- Proper Divisor Sum (Aliquot Sum)
- 3073
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 12264
- Möbius Function
- 1
- Radical
- 15335
- Omega Function (Ω)
- 2
- 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
- yes
- 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
- no
- Odd
- yes
Appears in sequences
- Coefficients of modular function g_2(tau).at n=9A003296
- Reverse and add (in base 4).at n=17A035524
- Numbers having four 5's in base 6.at n=34A043392
- n is such that pi(n*prime(n))/n is an integer.at n=7A084295
- 3n^3 + 2n^2 + n + 1.at n=17A130884
- Numbers k such that k and k^2 use only the digits 1, 2, 3, 5 and 6.at n=44A136974
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 0, 1), (1, 0, -1), (1, 0, 1), (1, 1, 1)}.at n=7A150959
- Number of binary strings of length n with no substrings equal to 0001 0011 or 1101.at n=17A164460
- Number of partitions of n containing a clique of size 7.at n=42A183564
- a(1)=1, a(2)=5, a(n) = a(n-1) + 5*a(n-2).at n=9A189732
- a(n) = 9*n^2 - 13*n + 5.at n=41A214675
- Number of nX3 arrays of the minimum value of corresponding elements and their horizontal, vertical or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..2 nX3 array.at n=9A219681
- Triangle, read by rows, T(n,k) = k*Sum_{i=0..n-k} C(2*i+2*k,i)*C(n-i-1,k-1)/(i+k) for 1 <= k <= n.at n=38A257488
- Expansion of Product_{k>=1} (1 + x^k)^(d(k)-1), where d(k) = number of divisors of k (A000005).at n=39A318844
- Numbers k such that 24*k-1 has at least three factors 7 and the partition function evaluated at k has at least the same number of factors 7 as 24*k-1.at n=18A340957
- a(n) is the least k such that A342956(k) = n.at n=11A342957