10811
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 11
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 11400
- Proper Divisor Sum (Aliquot Sum)
- 589
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 10224
- Möbius Function
- 1
- Radical
- 10811
- 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
- 68
- 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) = n*(15*n - 1)/2.at n=38A022272
- Convolution of Fibonacci numbers and composite numbers.at n=14A023609
- Sort then Add, a(1)=17.at n=10A033899
- a(n) = prime(n)*prime(n+1) - prime(n) - prime(n+1).at n=26A037165
- Number of partitions of n with equal number of even and odd parts.at n=49A045931
- Centered 10-gonal numbers.at n=46A062786
- Numbers k such that average of prime(k) and prime(k+1) is a perfect square.at n=43A076692
- a(n) = n * [1 + sum(k=1 to n) prime(k)].at n=19A083725
- Integers of the form 4n+3 for which Sum_{i=1..u} J(i,4n+3) obtains value zero exactly 9 times, when u ranges from 1 to (4n+3). Here J(i,k) is the Jacobi symbol.at n=35A166059
- Number of elements less than 1/2 in the Cross Set which is the subset of the set of distinct resistances that can be produced using n unit resistors in series and/or parallel.at n=18A176498
- Number of 6 X n integer arrays with each element equal to the number of horizontal and antidiagonal neighbors equal to itself.at n=7A266016
- Number of order-4 ribbon tilings for a 4 X n strip.at n=9A364424
- Centered 10-gonal numbers which are products of two primes.at n=18A367792
- Non-palindromic numbers m such that m * repunit of length k is palindromic for all large enough k.at n=45A370053
- Numbers of the form Product_{k=i..j} prime(k) - Sum_{k=i..j} prime(k) where i < j.at n=37A387946