15330
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 32
- Divisor Sum
- 42624
- Proper Divisor Sum (Aliquot Sum)
- 27294
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3456
- Möbius Function
- -1
- Radical
- 15330
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 5
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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 58
- 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
- Theta series of A_6 lattice.at n=18A008446
- Number of compositions into sums of cubes.at n=50A023358
- Base-9 digits are, in order, the first n terms of the periodic sequence with initial period 2,3,0.at n=4A037630
- Numbers m such that pi(m^2) is a square.at n=7A064523
- Sums of terms of groups in A075626.at n=29A075629
- Number of n-colorings of the octahedral graph.at n=7A115400
- Records for unitary abundant numbers, i.e., those integers which set a record for having a greater unitary abundance than any of their predecessors.at n=38A129499
- Composites one larger than a prime, with exactly five distinct prime factors.at n=29A136154
- Rectified heptapeton (6-simplex) numbers: the coefficient of x^(2n-2) in (1+x+x^2+...+x^(n-1))^7.at n=7A179097
- Exponential Riordan array, defining orthogonal polynomials related to permutations without double falls.at n=30A182822
- Least number k such that 2*k*n + 1 is a prime dividing 3^n + 1.at n=11A189240
- Triangular array read by rows. T(n,k) is the number of partial permutations (injective partial functions) of {1,2,...,n} that have exactly k elements in a cycle. The k elements are not necessarily in the same cycle. A fixed point is considered to be in a cycle.at n=31A206703
- Numbers n such that smallest number not dividing n^2 (A236454) is different from smallest prime not dividing n (A053669).at n=36A235921
- a(n) = (2*n-1)*210; numbers which are 210 times an odd number.at n=36A236432
- Number of cyclic arrangements of S={1,2,...,n} such that the difference between any two neighbors is at least 3.at n=10A242523
- Bisection of A136704 (divided by 2).at n=6A253077
- Expansion of Product_{k>=1} (1 + 5*x^k).at n=17A261569
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 345", based on the 5-celled von Neumann neighborhood.at n=27A271295
- a(n) = 12*n^2 + 18*n.at n=35A277980
- Triangle read by rows: T(n,k) = number of partitions of genus 2 of n elements with k parts (n >= 6, 2 <= k <= n-4).at n=12A297178