10277
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 10560
- Proper Divisor Sum (Aliquot Sum)
- 283
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9996
- Möbius Function
- 1
- Radical
- 10277
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 2
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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 55
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- Expansion of 1/((1-x)*(1-6*x)*(1-7*x)).at n=4A016241
- Strong pseudoprimes to base 44.at n=12A020270
- Shifts left under Weigh transform.at n=35A038073
- Discriminants of real quadratic fields with class number 1 and related continued fraction period length of 18.at n=46A050967
- Numbers k such that Euler phi(k) / Carmichael lambda(k) = 14.at n=22A066696
- Sum of the reverses of the first n primes.at n=40A071602
- A modified Fibonacci sequence controlled by a toggle switch. The toggle switch (initial state of 2) flips between 2 and 3 after each reduction.at n=41A096016
- a(n) is the least k such that k*(prime(n)#)^prime(n) - 1 is prime, where prime(n)# is the n-th primorial.at n=44A101047
- Triangular matrix, read by rows, equal to the matrix logarithm of triangle A105623.at n=30A105629
- Number triangle T(n,k) = Sum_{j=0..n} C(n-k,j-k)*C(j,n-j)*2^(n-j).at n=47A115991
- The sums of pairs of adjacent terms are the odd palindromic primes in ascending order.at n=24A181881
- Coefficient of x in the reduction by x^2 -> x+1 of the polynomial p(n,x) defined at Comments.at n=15A192957
- Number of partitions of n having standard deviation σ > 4.at n=39A238656
- Number of partitions p of n not including floor(mean(p)) as a part.at n=38A241335
- Number of n X 3 0..1 arrays with each 1 horizontally, vertically or antidiagonally adjacent to 0 or 2 neighboring 1s.at n=6A296330
- Number of nX7 0..1 arrays with each 1 horizontally, vertically or antidiagonally adjacent to 0 or 2 neighboring 1s.at n=2A296334
- T(n,k)=Number of nXk 0..1 arrays with each 1 horizontally, vertically or antidiagonally adjacent to 0 or 2 neighboring 1s.at n=38A296335
- T(n,k)=Number of nXk 0..1 arrays with each 1 horizontally, vertically or antidiagonally adjacent to 0 or 2 neighboring 1s.at n=42A296335
- Terms of A121707 not in A267999.at n=41A306097
- Numerators of the sequence whose Dirichlet convolution with itself yields A057660(n) = Sum_{k=1..n} n/gcd(n,k).at n=55A318444