10055
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 11
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 12072
- Proper Divisor Sum (Aliquot Sum)
- 2017
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8040
- Möbius Function
- 1
- Radical
- 10055
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 2
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
- no
- Narcissistic Number
- no
- Collatz Steps
- 91
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- no
- Odd
- yes
Appears in sequences
- Cubes written in base 6.at n=10A004636
- Number of partitions satisfying 0 < cn(1,5) + cn(4,5) + cn(2,5) and 0 < cn(1,5) + cn(4,5) + cn(3,5).at n=33A039902
- Number of primes whose binary expansion begins '11' (A080166) in range ]2^n,2^(n+1)].at n=17A095766
- Start with 1 and repeatedly reverse the digits and add 56 to get the next term.at n=41A118152
- Number of base 5 circular n-digit numbers with adjacent digits differing by 3 or less.at n=6A124999
- G.f. satisfies: A(x) = x/(x - B(x^2)) where B(x/A(x)) = x and B(x) is the g.f. of A141200.at n=16A178852
- Number of n X 5 arrays with each row a permutation of 1..5 having at least as many downsteps as the preceding row.at n=1A221620
- T(n,k)=Number of nXk arrays with each row a permutation of 1..k having at least as many downsteps as the preceding row.at n=16A221623
- Number of 2Xn arrays with each row a permutation of 1..n having at least as many downsteps as the preceding row.at n=4A221624
- Where record values occur in A227617.at n=15A227633
- Numbers n such that the sum of digits of 2n equals 4.at n=37A279772
- Array read by antidiagonals: T(m,n) = number of m-ary words of length n with cyclically adjacent elements differing by 3 or less.at n=29A285281
- Integers that need 10 iterations of the map x->A352172(x) to reach 1.at n=28A352268
- Number of non-isomorphic simple games with n players and one minimal winning vector.at n=15A385053
- Number of integer partitions of n with superdiagonal run-lengths.at n=50A388714