9311
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 9312
- 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
- 9310
- Möbius Function
- -1
- Radical
- 9311
- 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
- 1152
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Indices of prime Fibonacci numbers.at n=24A001605
- The sequence M(n) in A022905.at n=27A022908
- Primes that remain prime through 3 iterations of function f(x) = 4x + 9.at n=26A023282
- Primes that remain prime through 4 iterations of function f(x) = 4x + 9.at n=4A023312
- Triangle read by rows of numbers of permutations eliminating just card k out of n in game of Mousetrap.at n=39A028306
- 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=26A031593
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 48 ones.at n=32A031816
- Upper prime of a difference of 18 between consecutive primes.at n=37A031937
- Smallest k>1 such that k(p-1)-1 is divisible by p^2, p=n-th prime.at n=24A039914
- Denominators of continued fraction convergents to sqrt(47).at n=9A041081
- Denominators of continued fraction convergents to sqrt(188).at n=9A041349
- Denominators of continued fraction convergents to sqrt(423).at n=9A041805
- Primes of the form n*phi(n)-1 where phi is the Euler function (in order of appearance).at n=39A046078
- Let f(m) = smallest composite number that takes m steps of "add prime factors to number" to reach a prime and g(m) be the prime that is reached. Sequence gives values of g(m), sorted and duplicates removed.at n=10A050767
- Prime numbers with odd digits in descending order.at n=26A061245
- a(n)=Sum_{d|n} d*numbpart(d), where numbpart(d)=number of partitions of d, cf. A000041.at n=18A061259
- Numbers such that every cyclic permutation is a prime.at n=31A068652
- (p^2-5)/4 for odd primes p.at n=42A074367
- Numbers n such that n and Fibonacci(n) have the same number of divisors.at n=32A080651
- Prime indices of prime Fibonacci numbers.at n=23A083668