9863
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 26
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 11280
- Proper Divisor Sum (Aliquot Sum)
- 1417
- 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
- 8448
- Möbius Function
- 1
- Radical
- 9863
- 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
- 73
- 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
- Numbers k such that Fib(k) == 13 (mod k).at n=43A023178
- a(n) = Sum_{i=0..floor(n/2)} T(2i,n-2i), array T as in A048149.at n=32A049714
- a(1)=1; a(n) = a(n-1) + [sum of all decimal digits present so far in the sequence].at n=41A072921
- a(n) = Sum_{i=1..n} 2^(b(i) - 1), where b(n) is the differences between consecutive primes.at n=44A086769
- Numbers that are not the sum of two triangular numbers and a fourth power.at n=44A115160
- Number of cyclotomic cosets of 3 mod 10^n.at n=35A220018
- Exceptional odd numbers D that do not admit a solution to the Pell equation X^2 - D Y^2 = +2.at n=43A263010
- Number of n X 5 0..2 arrays with no element equal to any value at offset (0,-1) (-1,-1) or (-2,0) and new values introduced in order 0..2.at n=6A274892
- Number of 7 X n 0..2 arrays with no element equal to any value at offset (0,-1) (-1,-1) or (-2,0) and new values introduced in order 0..2.at n=4A274899
- Coordination sequence for 3D uniform tiling formed by stacking parallel layers of the 3.3.4.3.4 2D tiling (cf. A219529).at n=43A299255
- One of the two successive approximations up to 13^n for 13-adic integer sqrt(3). Here the 9 (mod 13) case (except for n = 0).at n=4A322086
- One of the two successive approximations up to 13^n for 13-adic integer sqrt(3). Here the 9 (mod 13) case (except for n = 0).at n=5A322086
- Number of times the digit 9 appears in the first 10^n decimal digits of Euler's number e = exp(1), counting starts after the decimal point.at n=4A322724
- Numbers that are both binary Niven numbers and binary Smith numbers.at n=33A334531
- Numerators of the partial sums of the reciprocals of the alternating sum of divisors function (A206369).at n=31A379619