9319
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
- 3
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 9320
- 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
- 9318
- Möbius Function
- -1
- Radical
- 9319
- 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
- 91
- 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
- 1153
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Tetrahedral numbers written backwards.at n=37A004161
- Primes of the form m^2 + 3m + 9, where m can be positive or negative.at n=30A005471
- If x and y are terms, so is x*y + 9.at n=43A009350
- Primes that remain prime through 3 iterations of function f(x) = 7x + 6.at n=18A023290
- 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=27A031593
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 70 ones.at n=6A031838
- Primes with indices that are primes with prime indices.at n=42A038580
- T(2n,n), array T as in A047130.at n=6A047139
- Primes prime(k) for which A049076(k) = 4.at n=7A049080
- Primes for which A049076 >= 4.at n=13A049090
- First member of a prime triple in a 2p-1 progression.at n=42A057326
- Let prime(i) = i-th prime, let twin(n) = (P,Q) be n-th pair of twin primes; sequence gives prime(Q).at n=40A057473
- Primes starting and ending with 9.at n=9A062335
- Take A000040, omit commas: 23571113171923..., select 4-digit primes seen when scanning from left.at n=20A073037
- Concatenate the primes as 2357111317192329313..., then insert commas from left to right so that between each pair of successive commas is a prime, always making the new prime as small as possible.at n=30A074721
- Cycle of the inventory sequence (as in A063850) starting with n consists of prime numbers.at n=28A078970
- First prime after phi(prime(n)^2).at n=24A079477
- Primes appearing as the concatenation of the last two digits of prime(A086102(n)) and the first two digits of prime(A086102(n)+1).at n=4A086103
- Primes which are also prime if their base 32 representation is interpreted as a base 10 number.at n=45A090716
- Primes p such that p's set of distinct digits is {1,3,9}.at n=18A108383