15055
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 18072
- Proper Divisor Sum (Aliquot Sum)
- 3017
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 12040
- Möbius Function
- 1
- Radical
- 15055
- 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
- 151
- 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
- tan(arcsinh(x)+arctan(x))=2*x+13/3!*x^3+305/5!*x^5+15055/7!*x^7...at n=3A013106
- a(n) = position of n^3 + (n+1)^3 + (n+2)^3 in A003072.at n=34A024972
- Exactly 5 digits from {1,2,3,4,5,6,7,8,9} can precede a(n) to form a lucky number.at n=37A032701
- Numerators of continued fraction convergents to sqrt(217).at n=8A041404
- Numerators of continued fraction convergents to sqrt(868).at n=4A042676
- Number of (n+1)X2 0..2 arrays with every 2X2 subblock determinant equal to some horizontal or vertical neighbor 2X2 subblock determinant.at n=4A186211
- Number of (n+1)X6 0..2 arrays with every 2X2 subblock determinant equal to some horizontal or vertical neighbor 2X2 subblock determinant.at n=0A186215
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2X2 subblock determinant equal to some horizontal or vertical neighbor 2X2 subblock determinant.at n=10A186218
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2X2 subblock determinant equal to some horizontal or vertical neighbor 2X2 subblock determinant.at n=14A186218
- Number of (n+1)X6 0..2 arrays with every 2X2 subblock determinant equal to exactly one or two horizontal and vertical neighbor 2X2 subblock determinants.at n=0A187423
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2X2 subblock determinant equal to exactly one or two horizontal and vertical neighbor 2X2 subblock determinants.at n=10A187425
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2X2 subblock determinant equal to exactly one or two horizontal and vertical neighbor 2X2 subblock determinants.at n=14A187425
- Number of n X n symmetric 0..3 arrays with each element equal to at least one horizontal or vertical neighbor and any new values 0..3 introduced in lower triangular row major order.at n=4A192640
- Total number of smallest parts in all partitions of n that do not contain 1 as a part.at n=38A195820
- Number of partitions of n containing m(1) as a part, where m denotes multiplicity.at n=40A240486
- Triangle, read by rows, with row n forming the coefficients in Product_{k=0..n} (1 + k^3*x).at n=17A249677
- Triangle read by rows, Stirling cycle numbers of order 3, T(n,n) = 1, T(n,k) = 0 if k<0 or k>n, otherwise T(n,k) = T(n-1,k-1)+(n-1)^3*T(n-1,k), for n>=0 and 0<=k<=n.at n=25A269947
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 129", based on the 5-celled von Neumann neighborhood.at n=29A270219
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 467", based on the 5-celled von Neumann neighborhood.at n=27A272320
- Expansion of 1 / ((1-x)^2*(1-x^2)*(1-x^3)*...*(1-x^9)).at n=29A288344