11900
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
- 36
- Divisor Sum
- 31248
- Proper Divisor Sum (Aliquot Sum)
- 19348
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3840
- Möbius Function
- 0
- Radical
- 1190
- Omega Function (Ω)
- 6
- 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
- 50
- 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
- Number of distinct values taken by 4^4^...^4 (with n 4's and parentheses inserted in all possible ways).at n=12A003019
- Degrees of irreducible representations of Held group He.at n=24A003912
- Taylor series related to one in Ramanujan's Lost Notebook.at n=26A006305
- Dodecahedral surface numbers: a(0)=0, a(1)=1, a(2)=20, thereafter 2*((3*n-7)^2 + 21).at n=28A007589
- a(n) = s(1)*s(n) + s(2)*s(n-1) + ... + s(k)*s(n+1-k), where k = floor((n+1)/2), s = (natural numbers >= 3).at n=46A024312
- Number of ternary rooted trees with n nodes and height at most 7.at n=14A036375
- a(n) in base 13 is a repdigit.at n=41A048337
- Numbers k such that x^k + x^5 + 1 is irreducible over GF(2).at n=27A057474
- G.f.: Product_{j>=1} (1 - x^j)^(-A000084(j)).at n=10A058499
- Numbers which contain exactly the same digits (with the correct multiplicity) in 3 different smaller bases.at n=18A059828
- Numbers that are sums of 2 or more consecutive squares in more than 1 way.at n=18A062681
- Matrix product of Stirling2-triangle A008277(n,k) and unsigned Stirling1-triangle |A008275(n,k)|.at n=32A079641
- Expansion of q^(-1/6) * eta(q^2)^3 / eta(q)^2 in powers of q.at n=49A085140
- Euler-Seidel matrix T(k,n) with start sequence A000248, read by antidiagonals.at n=31A098697
- T(n, k) = [x^k] Sum_{k=0..n} Stirling2(n, k)*RisingFactorial(x, k), triangle read by rows, for n >= 0 and 0 <= k <= n.at n=41A129062
- Numbers that are the sum of one or more consecutive squares in more than one way.at n=24A130052
- Sums of the products of n consecutive pairs of numbers.at n=20A135036
- Numbers k such that k and k^2 use only the digits 0, 1, 4, 6 and 9.at n=28A136862
- 5 times pentagonal numbers: 5*n*(3*n-1)/2.at n=40A152734
- a(n) = E(k)*C(n+k,k) = Euler(k)*binomial(n+k,k) for k=4.at n=13A154286