8950
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 16740
- Proper Divisor Sum (Aliquot Sum)
- 7790
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3560
- Möbius Function
- 0
- Radical
- 1790
- 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
- 140
- 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
- Numbers k such that the continued fraction for sqrt(k) has period 70.at n=33A020409
- Numbers in which 0,1,2,3,4,5 all occur in base 6.at n=18A031947
- Decimal part of a(n)^(1/4) starts with a 'nine digits' anagram.at n=3A034279
- Digitally balanced numbers in base 6: equal numbers of 0's, 1's, ..., 5's.at n=18A049357
- Sum of terms in n-th group in A075352.at n=42A075356
- Sums of groups in A075643.at n=23A075645
- Sum of numbers in n-th upward diagonal of triangle in A079823.at n=38A079824
- a(1) = 1, a(n) = smallest multiple of n such that the concatenation (n>1) a(n)a(n-1)... a(2) a(1) is a prime.at n=49A089330
- Consider the family of multigraphs enriched by the species of linear order. Sequence gives the triangle read by rows giving coefficients of polynomials arising from enumeration of those multigraphs on n edges, arcs and loops.at n=28A098288
- Number of n X n binary matrices with every 1 adjacent to some 0 and every 0 adjacent to some 1, horizontally or vertically.at n=2A133792
- Number of n X n binary arrays symmetric about main diagonal with all ones connected only in a 110-111-110 pattern in any orientation.at n=10A146267
- Number of n X n binary arrays symmetric about the diagonal and under 90 degree rotation with all ones connected only in a 110-111-110 pattern in any orientation.at n=23A146269
- a(n) = (2*n^3 + 5*n^2 - 5*n)/2.at n=19A162265
- Parameters k for which the Tate-Shafarevich group Ш of the elliptic curve y^2=x^3+k has order 16.at n=12A179130
- Sum of first k numbers in column k of the natural number array A000027; by antidiagonals.at n=19A185787
- Number of 3X2 integer matrices with each row summing to zero, row elements in nondecreasing order, rows in lexicographically nondecreasing order, and the sum of squares of the elements <= 2*n^2 (number of collections of 3 zero-sum 2-vectors with total modulus squared not more than 2*n^2, ignoring vector and component permutations).at n=44A192701
- T(n,k)=Majority value maps: number of nXk binary arrays indicating the locations of corresponding elements equal to at least half of their horizontal, diagonal and antidiagonal neighbors in a random 0..2 nXk array.at n=29A220922
- Majority value maps: number of 2Xn binary arrays indicating the locations of corresponding elements equal to at least half of their horizontal, diagonal and antidiagonal neighbors in a random 0..2 2Xn array.at n=6A220923
- a(n) = number of new distinct proper angles with vertex and legs on grid points in an n X n square grid that were not found in an (n-1) X (n-1) square grid.at n=25A252592
- Solution to 1 = Sum_y Product_{k in y} a(k) for each n > 0, where the sum is over all integer partitions of n with an odd number of parts.at n=42A300862