9193
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
- 4
- Divisor Sum
- 9540
- Proper Divisor Sum (Aliquot Sum)
- 347
- 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
- 8848
- Möbius Function
- 1
- Radical
- 9193
- 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
- 91
- Smith Number
- yes
- 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 k such that the continued fraction for sqrt(k) has period 57.at n=16A020396
- 5-morphic but not bimorphic, automorphic nor trimorphic.at n=44A056036
- McKay-Thompson series of class 40A for Monster.at n=45A058662
- Cycle of the inventory sequence (as in A063850) starting with n consists of prime numbers.at n=27A078970
- 2nd hyperbinomial transform of A001858.at n=5A089462
- Number of partitions of n into parts but with two kinds of parts of sizes 1,2,3,4 and 5.at n=18A103924
- Numbers m such that the permutation of the first m natural numbers R_m(n)=if(1<=n<m-pi(m), c(n), if(n=m, 1, prime(n-m-pi(m)+1))) is a cyclic permutation where c(k) is the k-th composite number(for each natural number k, c(k)=A002808(k)).at n=22A108517
- Numbers n such that (2^p + 1)/3 is prime, where p is the n-th prime.at n=31A123176
- Ulam's spiral (NNW spoke).at n=24A143860
- Square array A(n,m), n>=0, m>=0, read by antidiagonals: A(n,m) = n-th number of the m-th iteration of the hyperbinomial transform on sequence A001858.at n=33A144304
- a(n) = 12*n^2 - 8*n + 9.at n=27A167585
- Lower Beatty array of sqrt(3).at n=28A182787
- Number of multiset repetition class defining partitions of N with 1<=N<=n.at n=56A185976
- Smooth necklaces with 4 colors.at n=11A215329
- Numbers k such that 5^k + k^5 - 1 is prime.at n=9A215443
- Numbers n such that n^2 + 1 is divisible by a 4th power.at n=30A218563
- Partition of the positive odd integers into minimal blocks such that the concatenation of the numbers in each block is an evil number (A001969). Sequence lists the evil numbers obtained in this way.at n=19A248009
- Composites in base 10 that remain composite in exactly four bases b, 2 <= b <= 10, expansions interpreted as decimal numbers.at n=4A256354
- a(n) is the least integer k such that there are n values of i <= k for which gpf(i^2 + 1) = gpf(k^2 + 1), where gpf(x) is the greatest prime factor of x.at n=19A258840
- G.f. = b(2)*b(4)*b(6)/(x^8+x^6-x^5+x^4-2*x^3-x+1), where b(k) = (1-x^k)/(1-x).at n=16A266340