11037
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 15904
- Proper Divisor Sum (Aliquot Sum)
- 4867
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6768
- Möbius Function
- -1
- Radical
- 11037
- 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
- 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
- no
- Odd
- yes
Appears in sequences
- a(n) = sum of squares of first n positive integers congruent to 1 mod 4.at n=12A024381
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 70.at n=23A031568
- Denominators of continued fraction convergents to sqrt(393).at n=12A041747
- Number of connected 3 X n binary matrices with rightmost column [1,0,0]'.at n=5A054417
- Numbers k such that k^2 * 2^k + 1 is prime.at n=21A058780
- Let n = a_1a_2...a_k, where the a_i are digits. a(n) = least multiple of n of the type b_1a_1b_2a_2...a_kb_{k+1}, obtained by inserting single digits b_i in the gaps and both ends; 0 if no such number exists.at n=12A110735
- Triangle, read by rows, where row n forms a polynomial in y=2*k that generates diagonal n as k=0,1,2,... for n>=0; thus T(n,k) = Sum_{j=0..n-k} T(n-k,j)*(2*k)^j, with T(n,0)=T(n,n)=1.at n=30A113711
- Column 2 of triangle A113711, in which row n forms a polynomial in y=2*k that generates diagonal n as k=0,1,2,... for n>=0.at n=5A113713
- Numbers n such that n=d_1!!^2+d_2!!^2+...+d_k!!^2 where d_1d_2...d_k is the decimal expansion of n.at n=1A139409
- Numbers n with property that there is a different number m such that the lunar squares n*n and m*m are the same.at n=24A181319
- Numbers k such that either k^2*2^k-1 or k^2*2^k+1 is prime, but not both.at n=42A237759
- G.f. A(x) satisfies: A(x*A(-x)) = x^3 - x^2.at n=17A273034
- Sum of the second largest parts of the partitions of n into 9 squarefree parts.at n=45A326531