15029
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
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 18240
- Proper Divisor Sum (Aliquot Sum)
- 3211
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 12096
- Möbius Function
- -1
- Radical
- 15029
- Omega Function (Ω)
- 3
- 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
- 89
- 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
- no
- Odd
- yes
Appears in sequences
- a(n) = position of 3*n^3 in A003072.at n=35A024970
- Trajectory of 3 under map n->43n+1 if n odd, n->n/2 if n even.at n=7A037119
- Numbers k such that 201*2^k-1 is prime.at n=37A050852
- Number of rooted identity trees with n nodes and 7 leaves.at n=4A055332
- Expansion of g.f. (1 + x + 2*x^2)/((1 - x)^3*(1 - x^3)).at n=39A092498
- Binomial transform of [1, 4, 10, 20, 0, 0, 0, ...].at n=17A143131
- 7 times pentagonal numbers: a(n) = 7*n*(3*n-1)/2.at n=38A152744
- a(n) = 52*n^2 + 1.at n=17A158644
- a(n) = A030068(4n+1).at n=45A169739
- Number of nX4 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 1,3,0,4,2 for x=0,1,2,3,4.at n=6A196325
- Number of nX7 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 1,3,0,4,2 for x=0,1,2,3,4.at n=3A196328
- T(n,k)=Number of nXk 0..4 arrays with each element x equal to the number of its horizontal and vertical neighbors equal to 1,3,0,4,2 for x=0,1,2,3,4.at n=48A196329
- T(n,k)=Number of nXk 0..4 arrays with each element x equal to the number of its horizontal and vertical neighbors equal to 1,3,0,4,2 for x=0,1,2,3,4.at n=51A196329
- Principal diagonal of the convolution array A213773.at n=13A214092
- Number of simple labeled graphs on n nodes with exactly 2 connected components that are trees or cycles.at n=5A215852
- Number T(n,k) of simple labeled graphs on n nodes with exactly k connected components that are trees or cycles; triangle T(n,k), n>=0, 0<=k<=n, read by rows.at n=30A215861
- Number of simple labeled graphs on n+5 nodes with exactly n connected components that are trees or cycles.at n=2A215865
- Number of partitions of n such that (number of distinct parts) = maximal multiplicity of the parts.at n=48A239964
- Sum of the sizes of the longest clique of all partitions of n.at n=26A264397
- a(n) = floor(r*a(n-1)) + floor(r*a(n-2)) + floor(r*a(n-3)), where r = 3/2, a(0) = a(1) = a(2) = 1.at n=13A275873