11743
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 11744
- Proper Divisor Sum (Aliquot Sum)
- 1
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 11742
- Möbius Function
- -1
- Radical
- 11743
- Omega Function (Ω)
- 1
- Little Omega Function (ω)
- 1
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
- 81
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- yes
- Composite Number
- no
- Semiprime
- no
- Squarefree Number
- yes
- Prime Power
- yes
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 1409
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- a(n) = Sum_{k=0..n} (k+1)! binomial(n,k).at n=6A001339
- a(n+1) = 1 + a( floor(n/1) ) + a( floor(n/2) ) + ... + a( floor(n/n) ).at n=41A003318
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 62 ones.at n=19A031830
- Recursive prime generating sequence.at n=48A039726
- T(n,n-1), array T as in A047100.at n=8A047103
- Primes prime(k) for which A049076(k) = 3.at n=32A049079
- Primes base 10 that remain primes in five bases b, 2<=b<=10, expansions interpreted as decimal numbers.at n=37A052029
- Numbers k such that k^2 * 2^k - 1 is prime.at n=23A058781
- a(n) = a(n-1)*2^n-1 with a(1)=1.at n=4A073588
- Smallest prime p(k) such that the number of distinct prime divisors of all composite numbers between p(k) and p(k+1) is n.at n=43A075580
- Binomial triangle based on factorials.at n=34A076571
- Duplicate of A075580.at n=43A077132
- Smallest prime(k) such that 2^n divides the product of composite numbers between prime(k) and prime(k+1) but 2^(n+1) does not.at n=40A077216
- Primes p such that (r-p)/log(p) > 3, where r is the next prime after p.at n=32A082888
- Square array, read by antidiagonals, where the n-th row is the n-th binomial transform of the factorials, starting with row 0: {1!,2!,3!,...}.at n=29A089900
- Numerators of certain upper bounds for Euler's number e.at n=5A095822
- prime(k) for those k where floor((2*(prime(k+1)-prime(k))*PrimePi(k) mod (8*k))/k) = m with m = 10.at n=18A109564
- Primes for which the level is equal to 9 in A117563.at n=31A118481
- List of triples of primes with common difference 12.at n=26A128312
- Primes p such that q-p = 34, where q is the next prime after p.at n=3A134116