10862
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 16296
- Proper Divisor Sum (Aliquot Sum)
- 5434
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5430
- Möbius Function
- 1
- Radical
- 10862
- 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
- 99
- 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
- yes
- Odd
- no
Appears in sequences
- Representation degeneracies for Ramond strings.at n=16A005305
- Coordination sequence for MgCu2, Cu position.at n=26A009930
- Becomes prime after exactly 7 iterations of f(x) = sum of prime factors of x.at n=16A047826
- Matrix inverse of triangle A063967.at n=48A091698
- Number of elements in the free semigroup on 2 generators x, y which can be constructed from x and y using at most n multiplications.at n=6A098964
- a(n) = 3 + floor((2 + Sum_{j=1..n-1} a(j))/5).at n=45A120172
- Number of walks within N^2 (the first quadrant of Z^2) starting at (0,0) and consisting of n steps taken from {(-1, -1), (-1, 1), (0, 1), (1, -1), (1, 0), (1, 1)}.at n=6A151325
- Riordan array (1/(1-x),xc(x)/(1-xc(x))) where c(x)is the g.f. of A000108.It factorizes as A007318*A106566.at n=48A168216
- a(n) = number of steps to reach (3^n)-1 when starting from k = (3^(n+1))-1 and repeatedly applying the map that replaces k with k - (sum of digits in base-3 representation of k).at n=10A261234
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 262", based on the 5-celled von Neumann neighborhood.at n=41A271067
- Numbers k such that 39*10^k + 1 is prime.at n=21A282280
- a(n) = 11*Fibonacci(n+3) + Fibonacci(n-8) with n>=0.at n=13A282465
- Number of lattice 3-polytopes of width 2 and size n.at n=5A319961
- Number of compositions (ordered partitions) of n into distinct parts, the least being 3.at n=38A339164
- Semiprimes that are the sum of two successive semiprimes and also the sum of three successive semiprimes.at n=29A370162
- Number of integer compositions of n whose leaders of strictly increasing runs are strictly decreasing.at n=26A374689
- Number of pairs of nonnegative integers, not both equal to 0, with a shortest vectorial addition chain of length n.at n=10A383331