10010
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
- 24192
- Proper Divisor Sum (Aliquot Sum)
- 14182
- 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
- -1
- Radical
- 10010
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 5
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
- 29
- 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
- Numbers written in base of triangular numbers.at n=17A000462
- a(1)=0, a(2n) = a(n)+1, a(2n+1) = 10*a(n+1).at n=34A001202
- Least positive multiple of n written in base 3 using only 0 and 1.at n=20A004283
- Least positive multiple of n written in base 4 using only 0 and 1.at n=25A004284
- Least positive multiple of n written in base 5 using only 0 and 1.at n=34A004285
- Least positive multiple of n that when written in base 10 uses only 0's and 1's.at n=25A004290
- Least positive multiple of n that when written in base 10 uses only 0's and 1's.at n=13A004290
- a(n) = a(n-1) + a(n-7), with a(i) = 1 for i = 0..6.at n=44A005709
- From paths in the plane.at n=4A006859
- The binary numbers (or binary words, or binary vectors, or binary expansion of n): numbers written in base 2.at n=18A007088
- The number n written using the greedy algorithm in the base where the values of the places are 1 and primes.at n=9A007924
- n written in base where place values are positive squares.at n=28A007961
- 18 in base 18-n.at n=16A008715
- Expansion of Product_{k>=1} (1 - x^k)^13.at n=19A010820
- 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=10A014417
- Binary reflected Gray code.at n=28A014550
- Expansion of 1/(1 - x^7 - x^8 - ...).at n=51A017901
- Erroneous version of A307102.at n=16A019513
- Multinomial coefficients(TOP, BOTTOM), where TOP = n(n+1)(2n+1)/6, BOTTOM = ( 1^2 2^2 ... n^2 ).at n=2A022918
- Convolution of A001950 with itself.at n=19A023667