15050
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 11
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 32736
- Proper Divisor Sum (Aliquot Sum)
- 17686
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5040
- Möbius Function
- 0
- Radical
- 3010
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 4
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
- a(n) = n*(n+1)*(n+8)/6.at n=42A006503
- a(n) = 2*n*(4*n + 3).at n=43A033587
- Composite numbers k+1 such that k*phi(k+1) is a perfect square.at n=22A069068
- a(n) = smallest number k such that 2^n + k is a palindrome.at n=36A083463
- Triangle read by rows: S_B(n,k) = "Type B" Stirling numbers of the second kind.at n=24A085483
- Expansion of eta(q^3) * eta(q^33) / ( eta(q)* eta(q^11)) in powers of q.at n=45A128663
- 5 times heptagonal numbers: a(n) = 5*n*(5*n-3)/2.at n=35A153785
- a(n) = floor(n^(3/2))*floor(3+n^(3/2))/2.at n=30A185593
- O.g.f.: exp( Integral Sum_{n>=1} (2*n)! * x^(n-1) / Product_{k=1..2*n} (1 - k*x) dx ).at n=4A243509
- Numbers n such that the sum of digits of 2n equals 4.at n=43A279772
- Number of maximal matchings in the n-permutation star graph.at n=3A297482
- Numbers that occur in range of A324580.at n=41A324541
- a(n) = n * A276086(n).at n=43A324580
- Least common multiple of n and A276086(n).at n=43A328584
- a(n) is the Wiener index of a broom on 2n vertices of which n+2 are pendant.at n=25A349416
- Triangle read by rows: T(n,k) is the number of labeled threshold graphs on vertex set [n] in which k dominating vertices are added in standard iterative construction, n >= 1 and 0 <= k <= n-1.at n=24A350060
- Integers that need 10 iterations of the map x->A352172(x) to reach 1.at n=43A352268