11265
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
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 18048
- Proper Divisor Sum (Aliquot Sum)
- 6783
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6000
- Möbius Function
- -1
- Radical
- 11265
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 60
- 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
- Numbers that are the sum of 12 positive 10th powers.at n=11A004812
- a(n) = n*2^(n-1) + 1.at n=11A005183
- a(n) = n*(25*n + 1)/2.at n=30A022283
- Square of the lower triangular normalized partition matrix.at n=21A027516
- First column of A027516.at n=6A027528
- Numbers in which 0,1,2,3,4,5 all occur in base 6.at n=37A031947
- Numbers whose base-5 representation contains exactly three 0's and three 3's.at n=7A045202
- Minimal elements of pairs of "Super Unitary Amicable Numbers", sorted by their minimal elements.at n=29A045613
- a(n) = 512*n + 1.at n=22A076338
- Expansion of (1-x)^(-1)/(1-3*x-2*x^2-3*x^3).at n=7A077823
- Number of permutations satisfying -k<=p(i)-i<=r and p(i)-i not in I, i=1..n, with k=2, r=3, I={-1,0,1}.at n=42A080002
- a(n) = Sum_{d divides n} d*2^(n-n/d).at n=10A080267
- a(n) = Sum_{d|n} d*2^(d-1) for n > 0.at n=11A083413
- a(n) = 11*2^n + 1.at n=10A083683
- a(n) = (1/24)*(n+1)*(n+3)*(n^2+22*n+88).at n=18A090950
- E.g.f.: exp(x)/(1-x)^8.at n=4A095722
- a(n) = 2*a(n-1) - 1 for n>1, a(1)=23.at n=9A122041
- Numbers k such that 2*k+1, 4*k+1, 8*k+1 and 16*k+1 are primes.at n=12A124412
- Row sums of triangle A145364 (S1hat(-2)) and partition array A145363 (M31hat(-2)).at n=21A145365
- Triangle formed by coefficients of the expansion of p(x,n) = (1+x-x^2)^(n+1)*Sum_{j >= 0} (2*j+1)^n*(-x + x^2)^j.at n=38A156918