11241
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 9
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 16250
- Proper Divisor Sum (Aliquot Sum)
- 5009
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7488
- Möbius Function
- 0
- Radical
- 3747
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 2
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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 99
- 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
- no
- Odd
- yes
Appears in sequences
- MacMahon's generalized sum of divisors function.at n=41A002127
- Numbers k such that the continued fraction for sqrt(k) has period 82.at n=34A020421
- a(n) = floor(floor(S3)/floor(S1)), where S3 and S1 are, respectively, the 3rd and first elementary symmetric functions of {sqrt(k), k = 1,2,...,n}.at n=51A025200
- Expansion of Product_{m>=1} (1+x^m)^A000009(m).at n=22A050342
- Interprimes which are of the form s*prime, s=9.at n=34A075284
- Start with 1 and repeatedly reverse the digits and add 55 to get the next term.at n=26A118161
- Numbers k for which digitsum(k) + digitsum(k^2) + digitsum(k^3) = digitsum(k^4).at n=26A118470
- Number of pointed polyominoes with n cells.at n=9A126202
- Composite numbers, not ending with 0, sharing a 3-digit sequence with some of its prime factors.at n=4A131523
- Riordan array (1, x(1 - 4x)/(1 - 7x + 3x^2)).at n=40A147723
- G.f.: (1+x^4)/(1-x-x^8).at n=47A193942
- Numbers with digital product = 8.at n=41A199989
- Composite numbers whose product of digits is 8.at n=30A201056
- Number of (w,x,y) with all terms in {0,...,n} and the numbers w,x,y,|w-x|,|x-y| not distinct.at n=34A213491
- Trajectory of 80 under the map n-> A006368(n).at n=31A223087
- Bihappy numbers: numbers that reach 1 under iteration of the sum-of-squares-of-two-digits map s_2.at n=39A257795
- Numbers n which are both happy (A007770) and bihappy (A257795) numbers.at n=22A257950
- Expansion of Product_{k>=1} ((1+x^(3*k-1))*(1+x^(3*k-2)))^k.at n=36A262884
- Number of set partitions of [n] with symmetric block size list of length three.at n=9A275289
- Number of trees with n bicolored nodes and f nodes of the first color. Triangle T(n,f) read by rows, 0<=f<=n.at n=60A294783