10110
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
- 16
- Divisor Sum
- 24336
- Proper Divisor Sum (Aliquot Sum)
- 14226
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 2688
- Möbius Function
- 1
- Radical
- 10110
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 86
- 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
- Number of trees of diameter 4.at n=33A000094
- Number of points on surface of tricapped prism: a(n) = 7*n^2 + 2 for n > 0, a(0)=1.at n=38A005919
- The binary numbers (or binary words, or binary vectors, or binary expansion of n): numbers written in base 2.at n=22A007088
- a(0) = 1, a(n) = 28*n^2 + 2 for n>0.at n=19A010018
- Binary reflected Gray code.at n=27A014550
- Erroneous version of A307102.at n=19A019513
- Decimal expansion of a(n) is given by the first n terms of the periodic sequence with initial period 1,0,1.at n=4A033128
- Binary Fibonacci (or rabbit) sequence.at n=3A036299
- Positive numbers having the same set of digits in base 2 and base 10.at n=18A037415
- Sums of 3 distinct powers of 10.at n=6A038445
- a(n) is the negabinary expansion of n, that is, the expansion of n in base -2.at n=18A039724
- Number of partitions with at most one part divisible by 5.at n=33A039905
- Numbers having three 1's in base 10.at n=38A043495
- a(n)^2 is a square whose decimal expansion digits occur with an exact frequency of 3.at n=1A052095
- Numbers whose sum of digits is 3.at n=24A052217
- Trajectory of binary number 10110 under the operation 'Reverse and Add!' carried out in base 2.at n=0A058042
- Numbers which contain exactly the same digits (with the correct multiplicity) in 3 different smaller bases.at n=17A059828
- a(0) = 0, a(1) = 1, a(n) is the concatenation of a(n-2) and a(n-1) for n > 1.at n=4A061107
- Numbers k such that usigma(k) is a square and sets a new record for such squares.at n=18A064443
- 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=20A066327