10990
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 22752
- Proper Divisor Sum (Aliquot Sum)
- 11762
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- yes
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3744
- Möbius Function
- 1
- Radical
- 10990
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 4
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
- 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
- a(n) = n*(n^2 + 1)/2.at n=28A006003
- Weird numbers: abundant (A005101) but not pseudoperfect (A005835).at n=10A006037
- Unitary weird numbers: unitary abundant (A034683) but not unitary pseudoperfect (A293188).at n=6A064114
- a(0) = 5, a(1) = 7; for n>1, a(n) = a(n-1)+a(n-2)-(2n-2).at n=20A089061
- Number of permissible patterns of primes in a fixed interval of n consecutive integers.at n=34A094660
- Numbers n for which (4+n!)/4 is prime.at n=20A139061
- a(n) = 9n^2 - n.at n=34A154516
- a(n) = 686*n + 14.at n=15A157366
- Half the number of length n integer sequences with sum zero and sum of squares 3042.at n=3A157571
- a(n) = 1225*n^2 - 35.at n=2A158735
- Totally multiplicative sequence with a(p) = a(p-1) + 9 for prime p.at n=21A166706
- G.f.: A(x) = Sum_{n>=0} x^n / Product_{k=1..n} (1 - 2^(n-k)*x^k).at n=8A193188
- Number of n X 3 arrays of the minimum value of corresponding elements and their horizontal, vertical, diagonal or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and columns, 0..1 n X 3 array.at n=23A219349
- Smallest number k such that k*n +/- 1, k*n^2 +/- 1, and k*n^3 +/- 1 are three sets of twin primes. a(n) = 0 if no such number exists.at n=2A239021
- Row sums of the triangular array A246696.at n=27A246697
- G.f. satisfies: A(x) = Sum_{n>=0} x^n * Sum_{k=0..n} C(n,k)^2 * (x*A(x))^(2*k).at n=11A246861
- Decimal representation of the x-axis, from the origin to the right edge, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 865", based on the 5-celled von Neumann neighborhood.at n=13A284302
- Bi-unitary weird numbers: bi-unitary abundant numbers (A292982) that are not bi-unitary pseudoperfect (A292985).at n=11A292986
- Triangle read by rows, 0 <= k < n, n >= 2: T(n,k) is the eventual period of the modified Fibonacci sequence x(j) (or 0 if x(j) never enters a cycle) defined as follows: x(0) = 0, x(1) = 1, and for j > 1 x(j) is obtained from x(j-1) + x(j-2) by deleting all occurrences of the digit k in base n.at n=61A306773
- Infinitary weird numbers: infinitary abundant numbers (A129656) that are not infinitary pseudoperfect numbers (A306983).at n=11A306984