9371
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 9372
- Proper Divisor Sum (Aliquot Sum)
- 1
- 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
- 9370
- Möbius Function
- -1
- Radical
- 9371
- 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
- 184
- 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
- yes
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 1159
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Primes that remain prime through 3 iterations of function f(x) = 9x + 8.at n=28A023298
- Primes that remain prime through 4 iterations of the function f(x) = 9x + 8.at n=9A023326
- a(n) = b(n) + d(n), where b(n) = (n-th Lucas number > 3) and d(n) = (n-th number that is 1 or is not a Lucas number).at n=16A023497
- a(n) = b(n) + d(n), where b(n) = (n-th Lucas number > 3) and d(n) = (n-th number that is 1 or 2 or is not a Fibonacci number).at n=16A023498
- a(n) = b(n) + d(n), where b(n) = (n-th Lucas number > 1) and d(n) = (n-th number that is 1, 2, or 3, or is not a Lucas number).at n=17A023501
- 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 95.at n=33A031593
- Numbers whose set of base-8 digits is {2,3}.at n=33A032808
- Primes for which only two iterations of 'Prime plus its digit sum equals a prime' are possible.at n=41A048524
- Digitally balanced numbers in both bases 2 and 3.at n=37A049361
- a(n) = a(1) + a(2) + ... + a(n-1) - a(m) for n >= 4, where m = 2*n - 3 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1, a(2) = 3, and a(3) = 4.at n=14A049928
- Primes q of the form q = 10p + 1, where p is also prime.at n=36A055781
- Numbers k such that 7*10^k + 3*R_k is prime, where R_k = 11...1 is the repunit (A002275) of length k.at n=13A056720
- Primes with all odd digits such that the next three primes also contain all odd digits.at n=8A068831
- Primes with at least four digits such that sum of any three_neighbor_digits is prime; first and last digits are neighbors.at n=28A086259
- Primes in which the unit place digit is 1 and the k-th most significant digit is prime (2,3,5,7) if k is prime else is composite (4,6,8,9,0).at n=22A089704
- Denominator(Bernoulli(n-1) + 1/n)=66, where n runs through the primes.at n=40A090799
- Molien series for complete weight enumerators of self-dual codes over GF(9) containing the all-ones vector.at n=7A092072
- Upper prime of a difference of 22 between consecutive primes.at n=13A098976
- Primes p such that p's set of distinct digits is {1,3,7,9}.at n=6A108386
- G.f.: A(x) = (A_1)^2 where A_1 = 1/[1 - x*(A_2)^2], A_2 = 1/[1 - x^2*(A_3)^2], A_3 = 1/[1 - x^3*(A_4)^2], ... A_n = 1/[1 - x^n*(A_{n+1})^2] for n>=1.at n=12A132333