10857
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 18432
- Proper Divisor Sum (Aliquot Sum)
- 7575
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5520
- Möbius Function
- 1
- Radical
- 10857
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 4
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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 161
- Smith Number
- no
- 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
- Expansion of e.g.f.: cos(arcsin(x)*exp(x))=1-1/2!*x^2-6/3!*x^3-27/4!*x^4-100/5!*x^5...at n=8A012320
- Fibonacci sequence beginning 0, 11.at n=16A022345
- T(2n,n+2), T given by A026758.at n=6A026873
- a(n) = (2*n+1)*(10*n+1).at n=23A033574
- a(n) = n*(n+1)*(n^2+5*n+18)/24.at n=20A051744
- Numbers n such that sopf(n) = sopf(n+1) - sopf(n-1), where sopf(x) = sum of the distinct prime factors of x.at n=8A076525
- a(n) = sum of n Fibonacci numbers starting from F(n).at n=10A096140
- Last entry (and high point) in segment n of A079051.at n=37A117516
- Convolution of A066983 with the double Fibonacci sequence A103609.at n=20A121364
- a(n) = Sum_{k=floor((n+1)/2)..n} Fibonacci(k+1).at n=18A129361
- Odd squarefree numbers n such that the cyclotomic polynomial Phi(n,x) has height 5.at n=31A152943
- a(n) = 1331*n - 1122.at n=8A157441
- Let T be the sequence Fibonacci(2n+1), n>=0 (cf. A001519); sequence lists the differences T(j)-T(i) for i<j.at n=49A169691
- Number of ordered sextuples of distinct pairwise coprime positive integers with largest element n.at n=41A186977
- Number of n X 4 binary arrays without the pattern 0 0 diagonally or vertically.at n=4A188701
- T(n,k)=Number of nXk binary arrays without the pattern 0 0 diagonally or vertically.at n=32A188706
- Number of 5 X n binary arrays without the pattern 0 0 diagonally or vertically.at n=3A188709
- s(k)-s(j), where the pairs (k,j) are given by A205862 and A205863, and s(k) denotes the (k+1)-st Fibonacci number.at n=23A205864
- Number of pairs of parallel diagonals in a regular n-gon.at n=44A211379
- Number of undirected labeled graphs on n nodes with exactly 5 cycle graphs as connected components.at n=4A215765