15235
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
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 20016
- Proper Divisor Sum (Aliquot Sum)
- 4781
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 11040
- Möbius Function
- -1
- Radical
- 15235
- 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
- 177
- 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
- Number of 3-line partitions of n.at n=19A000991
- Coordination sequence for sigma-CrFe, Position Xc.at n=31A009961
- One-dimensional cellular automaton 'sigma' (Rule 150).at n=13A038185
- Numbers n such that sum of primes dividing n (with repetition) is equal to the largest prime factor of n+1.at n=23A071863
- Numbers n for which there are exactly twelve k such that n = k + reverse(k).at n=10A072435
- a(n) = Sum_{k=0..floor(n/2)} binomial(n,k)*3^(n-2*k).at n=8A100068
- Matrix inverse of triangle A122175, where A122175(n,k) = C( k*(k+1)/2 + n-k, n-k) for n>=k>=0.at n=40A121435
- Number of complete partitions of n.at n=37A126796
- Generalized Pascal Triangle - satisfying the same recurrence as Pascal's triangle, but with a(n,0)=1 and a(n,n)=10^n (instead of both being 1).at n=40A164844
- Numbers which are the sums of consecutive fourth powers.at n=44A217844
- Number of partitions of n such that the number of parts is a part and the number of distinct parts is a part.at n=53A241377
- a(0) = 0, a(n) = 10*a(n-1) + n*(n+1)*(n+2)/6.at n=5A262183
- a(n) = n*(67*n - 89)/2.at n=22A263227
- Number of 10-ascent sequences of length n with no consecutive repeated letters.at n=5A264915
- Decimal representation of the diagonal from the corner to the origin of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 417", based on the 5-celled von Neumann neighborhood.at n=26A288058
- Decimal representation of the diagonal from the corner to the origin of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 425", based on the 5-celled von Neumann neighborhood.at n=26A288129
- Decimal representation of the diagonal from the corner to the origin of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 598", based on the 5-celled von Neumann neighborhood.at n=26A289768
- Decimal representation of the diagonal from the corner to the origin of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 598", based on the 5-celled von Neumann neighborhood.at n=27A289768
- Expansion of 1 + Sum_{i>=1} Sum_{j>=1} x^(i*j) * Product_{k=1..i*j-1} (1+x^k).at n=50A373030