11000
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 2
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 32
- Divisor Sum
- 28080
- Proper Divisor Sum (Aliquot Sum)
- 17080
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4000
- Möbius Function
- 0
- Radical
- 110
- Omega Function (Ω)
- 7
- 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
- 42
- 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
- a(2n) = n+2, a(2n-1) = smallest number requiring n+2 letters in English.at n=22A000916
- Smallest natural number requiring n letters in English.at n=11A001166
- a(1)=0, a(2n) = a(n)+1, a(2n+1) = 10*a(n+1).at n=40A001202
- Expansion of g.f.: (1+x)/(1-10*x).at n=4A003953
- Cubes written in base 7.at n=13A004637
- Spiral sieve using Fibonacci numbers.at n=19A005623
- The binary numbers (or binary words, or binary vectors, or binary expansion of n): numbers written in base 2.at n=24A007088
- a(n) = floor(n/4)*floor((n+1)/4)*floor((n+2)/4)*floor((n+3)/4).at n=41A008233
- Numbers k such that k^2 and k have same last 3 digits.at n=44A008853
- a(2n-1) = n+2, a(2n) = smallest number requiring n+2 letters in English.at n=23A014388
- Binary reflected Gray code.at n=16A014550
- Erroneous version of A307102.at n=22A019513
- Product_{k=1..n} b(k), where b(k) = binary expansion of k (A007088) but read as if it were a decimal number.at n=4A020767
- a(n) = 2*(n+1) + 3*n + ... + (k+1)*(n+2-k), where k = floor((n+1)/2).at n=47A024305
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k=[ (n+1)/2 ], s = (natural numbers >= 2), t = (natural numbers >= 3).at n=46A024306
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (composite numbers), t = (odd natural numbers).at n=31A024590
- a(n) = 2*(n+1) + 3*n + ... + (k+1)*(n+2-k), where k = floor(n/2).at n=46A024868
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (composite numbers), t = (odd natural numbers).at n=30A025104
- (d(n)-r(n))/2, where d = A008778 and r is the periodic sequence with fundamental period (1,1,0,1).at n=47A026052
- Numbers k such that k^3 has at most three different digits.at n=47A030294