10100
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
- 18
- Divisor Sum
- 22134
- Proper Divisor Sum (Aliquot Sum)
- 12034
- 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
- 1010
- Omega Function (Ω)
- 5
- 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
- yes
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
- Multiply previous term by 2 and write in binary.at n=2A001098
- a(1)=0, a(2n) = a(n)+1, a(2n+1) = 10*a(n+1).at n=36A001202
- a(n) = (3*n+1)*(3*n+2).at n=33A001504
- The binary numbers (or binary words, or binary vectors, or binary expansion of n): numbers written in base 2.at n=20A007088
- The number n written using the greedy algorithm in the base where the values of the places are 1 and primes.at n=10A007924
- n written in base where place values are positive squares.at n=33A007961
- 20 in base 20-n.at n=18A008717
- Representation of n in base of Fibonacci numbers (the Zeckendorf representation of n). Also, binary words starting with 1 not containing 11, with the word 0 added.at n=11A014417
- Binary reflected Gray code.at n=24A014550
- a(n) = n*(n+1)*(4*n+5)/6.at n=24A016061
- Erroneous version of A307102.at n=17A019513
- a(n) = 1*(n+1-1) + 2*(n+1-2) + ... + k*(n+1-k), where k = floor((n+1)/2).at n=47A023856
- a(n) = 1*(n+3-1) + 2*(n+3-2) + .... + k*(n+3-k), where k=floor((n+1)/2).at n=46A023857
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (natural numbers), t = (natural numbers >= 2).at n=46A024853
- Molien series for Hecke group H_{3,4}.at n=19A027631
- Sorted Galois numbers.at n=29A028689
- Numbers k such that k^3 has at most three different digits.at n=46A030294
- Numbers that can be expressed as the product of two 3-digit numbers in at least one way.at n=1A033829
- Product of a prime and the previous number.at n=25A036689
- Positive numbers having the same set of digits in base 2 and base 10.at n=16A037415