11542
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 18000
- Proper Divisor Sum (Aliquot Sum)
- 6458
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5544
- Möbius Function
- -1
- Radical
- 11542
- 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
- 143
- 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
- Conjectured number of irreducible multiple zeta values of depth 7 and weight 2n+19.at n=19A022495
- Numbers k such that 175*2^k+1 is prime.at n=22A032464
- Sum of terms in periodic part of continued fraction expansion of square root of 1+3^n.at n=12A077630
- a(1)=1. a(n) = a(n-1) + sum of the triangular numbers which are among the first (n-1) terms of the sequence.at n=27A100963
- Numbers n such that n!*3^n - 1 is prime.at n=14A121859
- n^3 - (n+2)^2.at n=23A153258
- A triangle sequence of polynomial coefficients: p(x,n)=(-1)^(n + 1)*(x - 1)^(3*n + 1)*Sum[(Binomial[m, n]* Binomial[m + 1, n + 1]/(m - n + 1))*(m + 1)^ n*x^m, {m, 0, Infinity}]/(x^n); t(n,m)=coefficients(p(x,n)+x^n*p(1/x,n)).at n=14A155758
- A triangle sequence of polynomial coefficients: p(x,n)=(-1)^(n + 1)*(x - 1)^(3*n + 1)*Sum[(Binomial[m, n]* Binomial[m + 1, n + 1]/(m - n + 1))*(m + 1)^ n*x^m, {m, 0, Infinity}]/(x^n); t(n,m)=coefficients(p(x,n)+x^n*p(1/x,n)).at n=19A155758
- Number of strings of numbers x(i=1..6) in 0..n with sum i^3*x(i)^2 equal to 216*n^2.at n=35A184307
- Numbers k such that at least one other integer m exists with the same smallest and same largest prime factors, and same multisets of decimal and binary digits as k.at n=26A214621
- a(n) = n*prime(prime(n)) - prime(n)^2.at n=40A230098
- Nonprimes such that it takes exactly 3 iterations of reverse-and-add digits to generate a prime.at n=31A245208
- Bernoulli number B_{n} has denominator 354.at n=27A255684
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 627", based on the 5-celled von Neumann neighborhood.at n=21A273276
- Number of integer partitions whose sum of primes of parts equals their sum of parts plus n.at n=35A331387
- a(n) = A333552(A333551(n)): indices of terms in Recamán's sequence A005132 where the construction avoided a record-sized collision.at n=34A333553