15364
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 28224
- Proper Divisor Sum (Aliquot Sum)
- 12860
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7304
- Möbius Function
- 0
- Radical
- 7682
- Omega Function (Ω)
- 4
- 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
- 40
- 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
- Expansion of Product_{m>=1} (1 + m*q^m)^-3.at n=18A022695
- Number of asymmetric polygonal cacti with bridges (mixed Husimi trees).at n=14A035356
- Consider the trajectory of n under the iteration of a map which sends x to 3x - sigma(x) if this is >= 0; otherwise the iteration stops. The sequence gives values of n which eventually reach 0.at n=34A037159
- The lexicographically last sequence of binary encodings of solutions satisfying the equation given in A059871.at n=13A059875
- Smallest n-aspiring number. That is, a(n) = smallest k such that s^(n)(k) is perfect but s^(n-1)(k) is not, where s(k) is the sum of the aliquot parts of k and s^(i) means iterate s i times.at n=13A099771
- Number of 6-step S, NW and NE-moving king's tours on an n X n board summed over all starting positions.at n=11A187380
- a(0) = 16, after which, if a(n-1) = product_{k >= 1} (p_k)^(c_k), then a(n) = (1/2) * (1 + product_{k >= 1} (p_{k+1})^(c_k)), where p_k indicates the k-th prime, A000040(k).at n=20A246344
- Indices of zeros in A268819.at n=61A269157
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 275", based on the 5-celled von Neumann neighborhood.at n=28A271093
- Numbers n such that Bernoulli number B_{n} has denominator 1410.at n=19A272369
- Numbers k such that 5*10^k - 51 is prime.at n=18A294130
- Number of subsets of {1..n} such that it is not possible to choose a different prime factor of each element.at n=14A370583
- Number of integer partitions of n such that it is not possible to choose a different constant integer partition of each part.at n=36A387329
- Number of fixed polyominoes with perimeter 2n.at n=9A391197
- Number of 1324-avoiding permutations of [n] in which the largest element is not in the final position.at n=7A391315