11100
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 3
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 36
- Divisor Sum
- 32984
- Proper Divisor Sum (Aliquot Sum)
- 21884
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 2880
- Möbius Function
- 0
- Radical
- 1110
- Omega Function (Ω)
- 6
- 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
- yes
- 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
- Least positive multiple of n written in base 4 using only 0 and 1.at n=23A004284
- Least positive multiple of n that when written in base 10 uses only 0's and 1's.at n=11A004290
- The binary numbers (or binary words, or binary vectors, or binary expansion of n): numbers written in base 2.at n=28A007088
- An upper bound on the biplanar crossing number of the complete graph on n nodes.at n=42A007333
- a(1) = 2; to get a(n), n >= 2, convert a(n-1) from base 3 to base 2.at n=5A008560
- a(1) = 3; a(2) = 11; to get a(n), n >= 3, convert a(n-1) from base 3 to base 2.at n=4A008561
- Binary reflected Gray code.at n=23A014550
- Erroneous version of A307102.at n=25A019513
- a(n) = 4*n*(2*n + 1).at n=37A033586
- Positive numbers having the same set of digits in base 2 and base 10.at n=24A037415
- Numbers k such that k is a substring of its base-2 representation.at n=20A038102
- Sums of 3 distinct powers of 10.at n=9A038445
- a(n) is the negabinary expansion of n, that is, the expansion of n in base -2.at n=12A039724
- Numbers whose sum of digits is 3.at n=28A052217
- Least multiple of n consisting of a succession of 1's followed by a succession of 0's.at n=11A052983
- Binary string which equals n when 1's, 2's, 4's and 8's bits have weights -1, 1, 3, 6 respectively, while the other bits have their usual weights. -1 if no such string exists.at n=25A066327
- Binary string which equals n when 1's, 2's, 4's and 8's bits have weights 1, 1, 3, 5 respectively, while the other bits have their usual weights. -1 if no such string exists.at n=24A066329
- Binary string which equals n when 1's, 2's, 4's and 8's bits have weights 1, 2, 4, 5 respectively, while the other bits have their usual weights. -1 if no such string exists.at n=25A066330
- Binary string which equals n when 1's and 2's bits have negative weights.at n=28A066335
- (Sum of digits of n)^3 = sum of digits of n^3.at n=29A069263