8780
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 18480
- Proper Divisor Sum (Aliquot Sum)
- 9700
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3504
- Möbius Function
- 0
- Radical
- 4390
- 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
- Expansion of 1/((1-5x)(1-11x)(1-12x)).at n=3A020569
- a(n) = n*(11*n - 1)/2.at n=40A022268
- Numbers in which 0,1,2,3,4,5 all occur in base 6.at n=15A031947
- Number of partitions of n with equal number of parts congruent to each of 0, 1 and 3 (mod 5).at n=57A035573
- Digitally balanced numbers in base 6: equal numbers of 0's, 1's, ..., 5's.at n=15A049357
- a(n) = Sum[Sum[(i+j)!/i!/j!,{i,1,j}],{j,1,n}].at n=6A120279
- Expansion of x^2*(1+x-x^2)/(1-2*x-4*x^2+x^3+x^4).at n=9A123947
- Nonnegative values x of solutions (x, y) to the Diophantine equation x^2+(x+439)^2 = y^2.at n=6A130645
- Numbers k such that k and k^2 use only the digits 0, 1, 4, 7 and 8.at n=10A136864
- Numbers k such that k and k^2 use only the digits 0, 2, 4, 7 and 8.at n=28A136906
- Numbers k such that k and k^2 use only the digits 0, 3, 4, 7 and 8.at n=4A136933
- Numbers k such that k and k^2 use only the digits 0, 4, 5, 7 and 8.at n=6A136951
- Numbers k such that k and k^2 use only the digits 0, 4, 6, 7 and 8.at n=11A136954
- Numbers k such that k and k^2 use only the digits 0, 4, 7 and 8.at n=4A136958
- Numbers k such that k and k^2 use only the digits 0, 4, 7, 8 and 9.at n=15A136959
- Number of n X n binary arrays symmetric about main diagonal with all ones connected only in a tee 1,1 1,2 1,3 2,2 in any orientation.at n=8A145928
- Number of n X n binary arrays symmetric about the diagonal and under 90-degree rotation with all ones connected only in a tee 1,1 1,2 1,3 2,2 in any orientation.at n=19A145930
- Number of n X n arrays of squares of integers with every 3X3 subblock summing to 10.at n=1A159210
- Number of n X n arrays of squares of integers with every (n-1) X (n-1) subblock summing to 10.at n=1A159380
- 5 times centered pentagonal numbers: 5*(5*n^2 + 5*n + 2)/2.at n=26A164015