11237
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 11916
- Proper Divisor Sum (Aliquot Sum)
- 679
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 10560
- Möbius Function
- 1
- Radical
- 11237
- Omega Function (Ω)
- 2
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 161
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- no
- Odd
- yes
Appears in sequences
- a(n) = T(n,2n-2), T given by A027023.at n=9A027051
- Arrange digits of 2^n in ascending order.at n=17A028909
- Smallest number m with nonzero digits such that A046810(m)=n.at n=15A046813
- Truncated triangular pyramid numbers: a(n) = (n-7)*(n^2 + 10*n - 108)/6, n >= 8.at n=33A051941
- a(n) = 4*prime(n)^2+1.at n=15A060429
- Numerators of rational coefficients in a series expansion of z! = Gamma(z+1), convergent for Re(z) >= 0, given as equation (21) in the referenced paper by Lanczos.at n=2A090674
- Dot product of (1,2,...,n) and first n distinct Fibonacci numbers.at n=12A094584
- a(n) = 1 + 2 * least i such that A103509(i)=n+1, 0 if no such i exists.at n=44A103510
- Composite number of the form 4n^2+1.at n=34A121944
- Sums of three consecutive heptagonal numbers.at n=38A129111
- Appearance radii of visible vectors in the medial axis test mask for the Euclidean distance in Z^2.at n=15A171988
- Number of lower triangular n X n arrays colored with integers 0 upwards introduced in row major order, with no element equal to any horizontal, vertical or antidiagonal neighbor, and containing the value n(n+1)/2-2.at n=16A211924
- a(n) = arrange digits of concatenation of divisors of n (A037278, A176558) in increasing order in base 10 (zero digits are omitted).at n=20A243361
- Positions of squares in A276573.at n=38A277014
- Numbers n such that 3n appears earlier than 2n in A280864.at n=38A280755
- a(n) = 2^n*(n + 1) - 3*(n - 1).at n=9A291064
- The lowest number in the records of consecutive integers such that, beyond the first number, each number has a prime factor exponent that equals a prime factor exponent of the previous number.at n=45A388736
- a(n) = floor(n^2/3 + n^3/2).at n=28A390565