8743
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 10000
- Proper Divisor Sum (Aliquot Sum)
- 1257
- 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
- 7488
- Möbius Function
- 1
- Radical
- 8743
- 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
- 109
- 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 whose sum of divisors is a fourth power.at n=17A019422
- Strong pseudoprimes to base 93.at n=13A020319
- Strong pseudoprimes to base 94.at n=9A020320
- Numbers k such that Fib(k) == 13 (mod k).at n=40A023178
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 93.at n=9A031591
- Numbers k such that 245*2^k+1 is prime.at n=23A032499
- Numbers whose base-5 representation contains exactly three 3's and two 4's.at n=25A045306
- a(n) = 4*n^2 - 10*n + 7.at n=47A054554
- a(n) = 9*n^2 + 3*n + 1.at n=31A082040
- Numbers n such that (22^n-1)^2-2 is prime.at n=6A100907
- a(n) is the smallest number m such that sigma(m)=10^n and if there is no such m, a(n)=0.at n=4A110077
- Positive integers n such that 13^n == 6 (mod n).at n=2A116631
- Numbers of the form k^2+k+1 that are the product of two distinct primes.at n=42A176069
- Numbers n such that the greatest prime divisor p of n^2+1 has the property that (p - n)^2 + 1 = p.at n=35A206246
- 7^n mod 10000.at n=50A216130
- Numbers n such that there is an integer k with the property that k^tau(n) = sigma(n).at n=8A225239
- Construct sequences P,Q,R by the rules: Q = first differences of P, R = second differences of P, P starts with 1,5,11, Q starts with 4,6, R starts with 2; at each stage the smallest number not yet present in P,Q,R is appended to R; every number appears exactly once in the union of P,Q,R. Sequence gives P.at n=32A225376
- a(n) = n*prime(prime(n)) - prime(n).at n=21A230285
- Least integer k such that the n-th prime of form m^2+1 divides the composite number k^2+1.at n=18A255675
- Least positive integer k such that sigma(k) and phi(k*n) are both squares, where sigma(k) is the sum of all positive divisors of k, and phi(.) is Euler's totient function.at n=52A259916