11150
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 8
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 20832
- Proper Divisor Sum (Aliquot Sum)
- 9682
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4440
- Möbius Function
- 0
- Radical
- 2230
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 68
- 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
- Number of vertex-transitive graphs with n nodes.at n=34A006799
- Number of partitions of n into parts not of form 4k+2, 16k, 16k+5 or 16k-5.at n=54A036022
- Sum of squares of entries of Wilkinson's eigenvalue test matrix of order 2n+1.at n=25A059834
- Number of permutations satisfying -k<=p(i)-i<=r and p(i)-i not in I, i=1..n, with k=1, r=5, I={2,4}.at n=17A079959
- Numbers k such that f(k), f(k+1) and f(k+2) are all primes, where f(k) = 8*k^2 + 4*k + 1.at n=38A103777
- a(1) = 668; for n > 1, a(n) = a(n-1) + 1 + sum of distinct prime factors of a(n-1) that are < a(n-1).at n=33A105212
- Site series for second perpendicular moment of Kagome lattice.at n=12A120552
- Sum of all parts of the last section of the set of partitions of n.at n=24A138879
- Partials sums of A001694.at n=43A174172
- Describe 10^n. Also called the "Say What You See" or "Look and Say" sequence LS(10^n).at n=15A191111
- G.f. satisfies: A(x,y) = 1 + Sum_{n>=1} x^n*y*A(x,y)^n/(1 - y*A(x,y)^(2*n)), where A(x,y) = 1 + Sum_{n>=1,k>=1} T(n,k)*x^n*y^k; here the coefficients T(n,k) form a square array and are read by antidiagonals.at n=61A192404
- a(n) = Sum_{k=0..3} f(n+k)^2 where f=A130519.at n=20A238604
- Number of (n+1)X(4+1) 0..3 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing absolute value of x(i,j)-x(i-1,j) in the j direction.at n=0A250687
- T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing absolute value of x(i,j)-x(i-1,j) in the j direction.at n=6A250691
- Number of (1+1) X (n+1) 0..3 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing absolute value of x(i,j)-x(i-1,j) in the j direction.at n=3A250692
- Numbers n such that n^1024 + (n+1)^1024 is prime.at n=17A274234
- Number of compositions (ordered partitions) of n into at most 5 prime powers (including 1).at n=34A347775
- The smallest of 3 consecutive integers such that the first is divisible by the square of a prime, the second is divisible by the cube of a prime, and the third is divisible by the fourth power of a prime.at n=3A349952