11238
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 22488
- Proper Divisor Sum (Aliquot Sum)
- 11250
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 3744
- Möbius Function
- -1
- Radical
- 11238
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 161
- 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
- Expansion of Product_{m>=1} (1+q^m)^(-6).at n=16A022601
- Matrix 9th power of partition triangle A008284.at n=29A050303
- Number of positive integers <= 2^n of form 6*x^2 + 7*y^2.at n=17A054182
- McKay-Thompson series of class 8b for Monster.at n=32A058088
- a(n) = a(n-1) + a(floor(n/2))^2 for n > 0, a(0) = 1.at n=10A067868
- McKay-Thompson series of class 8c for the Monster group.at n=32A112145
- McKay-Thompson series of class 16a for the Monster group.at n=16A112150
- Let S be the set of positive integers that, when written in binary, exist as substrings in the binary representation of n. a(n) = number of partitions of n into parts that are all members of S. Each part may occur any number of times in a partition.at n=50A175359
- Numbers n such that there is no triangular n-gonal number greater than 1.at n=26A188892
- Numbers k such that k divides 1 + Sum_{j=1..k} prime(j)^14.at n=32A232966
- Expansion of chi(x^5)^6 + x * chi(x)^6 in powers of x where chi() is a Ramanujan theta function.at n=17A240948
- Numbers k such that 6*10^k + 73 is prime.at n=21A285937
- Numbers with digits in nondecreasing order such that additive and multiplicative digital roots coincide.at n=41A318273
- Number of length-n ternary words containing no even palindromes of length > 0 and no odd palindromes of length > 3.at n=20A330132
- Consider the figure made up of a row of n adjacent congruent rectangles, with diagonals of all possible rectangles drawn; a(n) is the number of interior vertices where exactly four lines cross.at n=39A336490
- Number of partitions of the n-th n-gonal number into distinct n-gonal numbers.at n=53A337763
- a(n) = Sum_{k=1..n} sigma(k)*sigma(2*k), where sigma(n) = A000203(n) is the sum of the divisors of n.at n=16A347108
- Indices k such that A377091(k) is immediately followed by A377091(k+1) = -A377091(k).at n=46A379802
- Upper (1/3,1/2) midsequence of (n^2) and (n^3); see Comments.at n=28A390566
- a(n) = Sum_{k=0..n} binomial(k+2,2) * binomial(k,2*(n-k)).at n=11A391963