8277
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 11520
- Proper Divisor Sum (Aliquot Sum)
- 3243
- 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
- 5280
- Möbius Function
- -1
- Radical
- 8277
- Omega Function (Ω)
- 3
- 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
- 127
- Smith Number
- yes
- 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
- no
- Odd
- yes
Appears in sequences
- a(n) = (4*n+1)*(4*n+5).at n=22A003185
- Coordination sequence for sigma-CrFe, Position Xd.at n=23A009959
- 4-digit terms in the continued fraction for Pi.at n=2A048958
- Decimal encoding of the prime factorization of n is a multiple of n.at n=2A067598
- The prime factors of n are also prime factors of the decimal encoding (A067599) of the prime factorization of n.at n=22A067671
- a(n) = (2*n+5)*(2*n+1).at n=44A078371
- Number of partitions of n into parts having at most two prime-factors.at n=33A101049
- a(1) = 3, a(n) = least k such that concatenation of n copies of k with all previous concatenation gives a prime.at n=46A111473
- a(1)=7; a(n)=floor((35+sum(a(1) to a(n-1)))/5).at n=39A120175
- Third trisection of A061037.at n=29A142600
- a(n) = smallest k such that A109671(k)=n, or -1 if n does not appear in A109671.at n=39A169741
- Trisection A061037(3*n-2) of the Balmer spectrum numerators extended to negative indices.at n=31A174325
- Number of nondecreasing arrangements of 7 numbers x(i) in -(n+5)..(n+5) with the sum of sign(x(i))*2^|x(i)| zero.at n=12A187991
- Triangle of coefficients of polynomials v(n,x) jointly generated with A209773; see the Formula section.at n=41A209774
- G.f. A(x) satisfies A(x) = 1 + x / (1 - x * A(x^2)).at n=21A218032
- Number of partitions of n such that m(1) > m(3), where m = multiplicity.at n=34A240059
- Numbers k such that anti-phi(k) = anti-phi(k+1).at n=38A241003
- Number of (n+1)X(7+1) 0..1 arrays with no 2X2 subblock having x11-x00 less than x10-x01.at n=1A251267
- T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with no 2X2 subblock having x11-x00 less than x10-x01.at n=29A251268
- Number of (2+1) X (n+1) 0..1 arrays with no 2 X 2 subblock having x11-x00 less than x10-x01.at n=6A251269