11260
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 10
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 23688
- Proper Divisor Sum (Aliquot Sum)
- 12428
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4496
- Möbius Function
- 0
- Radical
- 5630
- Omega Function (Ω)
- 4
- 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
- 161
- 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
- yes
- Odd
- no
Appears in sequences
- Self-convolution of composite numbers.at n=26A023648
- Numbers n such that the first n digits of sqrt(2) form a prime.at n=3A115377
- a(n) = T(p(n)) - p(T(n)) = Commutator[triangular numbers, primes] at n.at n=44A123907
- Numbers k such that (sum of base-2 digits of k) = (sum of base-10 digits of k) = 10.at n=13A152207
- Number of nondecreasing integer sequences of length 10 with sum zero and sum of absolute values 2n.at n=14A158144
- Number of ways to place 3 nonattacking wazirs on a 3 X n board.at n=14A172229
- Row sums of A175105.at n=10A176084
- Describe 10^n. Also called the "Say What You See" or "Look and Say" sequence LS(10^n).at n=26A191111
- Triangular array: the fission of ((x+1)^n) by ((2x+1)^n).at n=42A193858
- Mirror of the triangle A193858.at n=38A193859
- Partial sums of A100381.at n=7A196514
- Number of (w,x,y,z) with all terms in {1,...,n} and |w-x| = 2*|x-y| - |y-z|.at n=30A212578
- Least number having n orderless representations as p^2 + q^2 + r^2 + s^2, where p, q, r, and s are primes.at n=38A214513
- Number of length n+4 0..4 arrays with no five consecutive terms having four times any element equal to the sum of the remaining four.at n=1A249462
- T(n,k)=Number of length n+4 0..k arrays with no five consecutive terms having four times any element equal to the sum of the remaining four.at n=11A249466
- Number of length 2+4 0..n arrays with no five consecutive terms having four times any element equal to the sum of the remaining four.at n=3A249468
- a(n) = A273059(4n+3).at n=18A275919
- Birooted graphs: number of unlabeled connected graphs with n nodes rooted at 2 indistinguishable roots.at n=6A303831
- Triangle T(n,k) read by rows: number of bicolored connected graphs with n nodes and k nodes of the first color.at n=30A304311
- Triangle T(n,k) read by rows: number of bicolored connected graphs with n nodes and k nodes of the first color.at n=33A304311