1010
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 2
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 1836
- Proper Divisor Sum (Aliquot Sum)
- 826
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 400
- Möbius Function
- -1
- Radical
- 1010
- Omega Function (Ω)
- 3
- 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
- no
Recreational
- Happy Number
- no
- Harshad Number
- yes
- Narcissistic Number
- no
- Collatz Steps
- 62
- 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=12A000462
- a(1)=0, a(2n) = a(n)+1, a(2n+1) = 10*a(n+1).at n=18A001202
- Smallest k such that the product of q/(q-1) over the primes from prime(n) to prime(n+k-1) is greater than 2.at n=22A001276
- 2nd differences are periodic.at n=23A002082
- Numbers that are the sum of 11 positive 5th powers.at n=43A003356
- Roman numerals with 1 letter, in numerical order; then those with 2 letters, etc.at n=33A003587
- Roman numerals with 1 letter, in alphabetical order; then those with 2 letters, etc.at n=31A003588
- For m=2,3,..., write m in bases 2,3,..,m.at n=36A004053
- For m=2,3,..., write m in bases m,m-1,...,3,2.at n=44A004209
- Least positive multiple of n written in base 3 using only 0 and 1.at n=14A004283
- Least positive multiple of n written in base 3 using only 0 and 1.at n=29A004283
- Least positive multiple of n written in base 4 using only 0 and 1.at n=33A004284
- Least positive multiple of n written in base 7 using only 0 and 1.at n=34A004287
- Least positive multiple of n written in base 8 using only 0 and 1.at n=19A004288
- Least positive multiple of n written in base 8 using only 0 and 1.at n=9A004288
- Least positive multiple of n written in base 8 using only 0 and 1.at n=25A004288
- a(n) = least integer m > a(n-1) such that m - a(n-1) != a(j) - a(k) for all j, k less than n; a(1) = 1, a(2) = 2.at n=31A004978
- Number of symmetric trivalent maps with n nodes.at n=7A005028
- a(n) is the number of forests with n (unlabeled) nodes in which each component tree is planted, that is, is a rooted tree in which the root has degree 1.at n=10A005198
- a(n) = n*(5*n+1)/2.at n=20A005475