10988
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 26
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 19992
- Proper Divisor Sum (Aliquot Sum)
- 9004
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5280
- Möbius Function
- 0
- Radical
- 5494
- Omega Function (Ω)
- 4
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 68
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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
- a(0)=2; a(n) is the smallest k > a(n-1) such that the fractional part of k^(1/11) starts with n.at n=33A034076
- Numbers k such that 3^k + 2 is prime.at n=32A051783
- Consider all integer triples (i,j,k), j >= k>0, with i^3=binomial(j+2,3)+binomial(k+2,3), ordered by increasing i; sequence gives k values.at n=12A054210
- Numbers k such that the sum of the k-th triangular number and (k+2)-nd triangular number is a triangular number.at n=10A076049
- Number of solutions to n^2 < x^2 + y^2 + z^2 < (n+1)^2; number of lattice points between spheres of radii n and n+1.at n=29A078184
- a(n) = C(2n-1,n-1) mod n^3.at n=25A099907
- Numbers n such that p(9n) is prime, where p(n) is the number of partitions of n.at n=20A114169
- Matrix cube of triangle V = A136230, read by rows.at n=17A136237
- Index sequence to A089840: positions of bijections that preserve A127302 (the non-oriented form of binary trees) and whose behavior does not depend on whether there are internal or terminal nodes (leaves) in the neighborhood of any vertex.at n=39A153830
- Number of nX5 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 1,4,3,2,0 for x=0,1,2,3,4.at n=8A196926
- For any number n take the polynomial formed by the product of the terms (x-pi), where pi's are the prime factors of n. Then calculate the area between the minimum and the maximum value of the prime factors. This sequence lists the numbers for which the area is equal to zero.at n=30A203614
- a(0)=1, a(n) = a(n-1) + a(2*n AND n), where AND is the bitwise AND operator.at n=45A215488
- Number of (n+1) X (3+1) 0..2 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 2 (constant-stress 1 X 1 tilings).at n=7A234261
- a(n) = binomial(2*c-1, c-1) (mod c^3), where c is the n-th composite.at n=15A244214
- Numbers missing from A317416.at n=2A317418
- Expansion of e.g.f. ( Product_{k>0} 1/(1 - x^k)^(1/k!) )^exp(x).at n=6A356596
- Number of integer partitions of n whose minima of maximal anti-runs are not all different.at n=34A375404