11110
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 4
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 22032
- Proper Divisor Sum (Aliquot Sum)
- 10922
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4000
- Möbius Function
- 1
- Radical
- 11110
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 4
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
- 130
- 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
- yes
- Odd
- no
Appears in sequences
- To get the 3rd term, for example, note that 2nd term has three (11 in binary!) 1's and one (1) 0, giving 11 1 1 0.at n=2A001391
- Least positive multiple of n written in base 3 using only 0 and 1.at n=23A004283
- Least positive multiple of n written in base 5 using only 0 and 1.at n=19A004285
- Least positive multiple of n written in base 8 using only 0 and 1.at n=29A004288
- Least positive multiple of n written in base 9 using only 0 and 1.at n=11A004289
- The binary numbers (or binary words, or binary vectors, or binary expansion of n): numbers written in base 2.at n=30A007088
- Binary reflected Gray code.at n=20A014550
- Erroneous version of A307102.at n=27A019513
- a(n) = n^4 + n^3 + n^2 + n.at n=10A027445
- Numbers whose maximal base-10 run length is 4.at n=10A033285
- 4-white numbers: partition digits of n^4 into blocks of 4 starting at right; sum of these 4-digit numbers equals n.at n=4A037044
- Positive numbers having the same set of digits in base 2 and base 10.at n=26A037415
- Sums of 4 distinct powers of 10.at n=4A038446
- a(n) is the negabinary expansion of n, that is, the expansion of n in base -2.at n=10A039724
- Numbers having four 1's in base 10.at n=4A043496
- Numbers with exactly 4 distinct palindromic prime factors.at n=24A046402
- Describe the previous term in binary (method A - initial term is 0).at n=3A049064
- Revert transform of (1 + 2x - x^2)/(1 + 3x + 2x^2 + x^3).at n=11A049131
- A052999 / 18.at n=9A053544
- Successive positions in Tower of Hanoi (with three pegs {0,1,2}) where xyz means smallest disk is on peg z, second smallest is on peg y, third smallest on peg x, etc. and leading zeros indicate largest disks are all on peg 0.at n=30A055662