10877
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 11100
- Proper Divisor Sum (Aliquot Sum)
- 223
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 10656
- Möbius Function
- 1
- Radical
- 10877
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 68
- 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
- Bruckman-Lucas pseudoprimes: k | (L_k - 1), where k is composite and L_k = Lucas numbers A000032.at n=7A005845
- Composite n coprime to 5 such that Fibonacci(n) == Legendre(n,5) (mod n).at n=5A049062
- Numbers n such that sigma(n)^2 - phi(n)^2 is a perfect square.at n=31A057654
- Numbers n such that the Reverse and Add! trajectory of n (presumably) does not reach a palindrome and does not join the trajectory of any term m < n.at n=22A063048
- Composite numbers k that divide Fibonacci(k+1).at n=6A069107
- Reverse of smallest prime factor of k = largest prime factor of k+1; a(1)=1.at n=12A071392
- Odd Fibonacci pseudoprimes: odd composite numbers k such that either (1) k divides Fibonacci(k-1) if k == +-1 (mod 5) or (2) k divides Fibonacci(k+1) if k == +-2 (mod 5).at n=9A081264
- Least x = a(n) such that sum of common prime divisors (without multiplicity) of sigma(x) and phi(x) equals n, or 0 if such number (apparently) does not exist.at n=41A082056
- Numbers k such that the Reverse and Add! trajectory of k (presumably) does not reach a palindrome (with the exception of k itself) and does not join the trajectory of any term m < k.at n=23A088753
- Composite n such that Fibonacci(n) == Legendre(n,5) == -1 (mod n).at n=1A094063
- Odd composite n such that n divides Fibonacci(n) + 1.at n=1A094395
- Composite numbers k that divide both Fibonacci(k+1) and Fibonacci(k) + 1.at n=1A094411
- Sum of n-th prime squared and n-th perfect square.at n=25A106587
- Numbers n such that sigma(n) - phi(n) is a repdigit greater than 2.at n=38A116020
- Composite terms in A128288(n) = A023163(n)/3 for n>1.at n=2A128289
- Denominators of the continued fraction convergents of the decimal concatenation of the odd natural numbers.at n=8A128840
- G.f.: A(x) = exp( Sum_{n>=1} sigma(n)*x^n/(1+x^n) /n ).at n=46A158441
- Lucas pseudoprimes whose reversal is prime.at n=0A164824
- Semiprimes k that divide Fibonacci(k+1).at n=4A177745
- a(n) = 8*n^2 + 14*n + 5.at n=36A181890