10886
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 16332
- Proper Divisor Sum (Aliquot Sum)
- 5446
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5442
- Möbius Function
- 1
- Radical
- 10886
- 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
- 68
- 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
- Number of edges in graph of maximal intersecting families of sets.at n=5A007006
- a(n) = number of (s(0), s(1), ..., s(n)) such that every s(i) is an integer, s(0) = 0 = s(n), |s(i) - s(i-1)| = 1 for i = 1,2; |s(i) - s(i-1)| <= 1 for i >= 3. Also a(n) = T(n,n), where T is the array defined in A024996.at n=8A024997
- Number of partitions of n such that cn(0,5) = cn(2,5) < cn(1,5) <= cn(3,5) = cn(4,5).at n=72A036856
- a(n) = (7*6^n - 2)/5.at n=5A061801
- Sums of rows of triangle in A077385.at n=5A077386
- Square array of numbers read by antidiagonals where T(n,k) = ((k+3)*(k+2)^n-2)/(k+1).at n=50A090842
- Numbers k such that (6^k)*(2^k - 1) - 1 is prime.at n=10A098863
- Numbers k such that Sum_{j=1..k-1} j*2^(j-1) is prime.at n=10A119529
- Bond series for second perpendicular moment of Kagome lattice.at n=10A120548
- Table by rows, the number E(n;2) of binary-alphabet topological epsilon-machines as a function of the number of states n and edges k.at n=14A181621
- Moore lower bound on the order of a (7,g)-cage.at n=8A198307
- Numbers n such that there are precisely 2 groups of order n and 3 of order n + 1.at n=12A296025
- Number of nX3 0..1 arrays with every element equal to 0, 2, 3, 5, 6 or 7 king-move adjacent elements, with upper left element zero.at n=10A299244
- Replace k with k! in the prime indices of n.at n=25A325709
- Numbers k such that 1 is in the transitive closure of the map x -> A353313(x) when starting iterating from x=k.at n=43A353306
- Lexicographically earliest sequence of distinct nonnegative terms wherein every digit of a(n) is the absolute difference of two adjacent digits in a(n+1).at n=18A362335
- Squarefree semiprimes (products of two distinct primes) between sphenic numbers (products of three distinct primes).at n=31A362507
- Number of integer partitions of n such that the least part plus the greatest part is odd.at n=36A390092