293
domain: N
Properties
Digital Properties
- Digit Count
- 3
- 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
- 294
- 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
- 292
- Möbius Function
- -1
- Radical
- 293
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 117
- Smith 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
- 62
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Names
- German
- zweihundertdreiundneunzig· ordinal: zweihundertdreiundneunzigste
- English
- two hundred ninety-three· ordinal: two hundred ninety-third
- Spanish
- doscientos noventa y tres· ordinal: 293º
- French
- deux cent quatre-vingt-treize· ordinal: deux cent quatre-vingt-treizième
- Italian
- duecentonovantatre· ordinal: 293º
- Latin
- ducenti nonaginta tres· ordinal: 293.
- Portuguese
- duzentos e noventa e três· ordinal: 293º
Appears in sequences
- Number of permutations of [n] in which the longest increasing run has length 3.at n=5A000402
- a(n) = (n+2)*Catalan(n) - 1.at n=5A000777
- Duplicate of A003436.at n=4A000858
- Irregular primes: primes p such that at least one of the numerators of the Bernoulli numbers B_2, B_4, ..., B_{p-3} (A000367) is divisible by p.at n=13A000928
- Primes with primitive root 2.at n=25A001122
- Expansion of 1/((1-x)^2*(1-x^2)*(1-x^5)*(1-x^10)*(1-x^20)).at n=20A001305
- Number of ways of making change for n cents using coins of 1, 2, 4, 10, 20, 40, 100 cents.at n=40A001310
- Number of ways of making change for n cents using coins of 1, 2, 4, 10, 20, 40, 100 cents.at n=41A001310
- Triangle of values of 2-d recurrence.at n=37A001404
- Number of n-stacks with strictly receding walls, or the number of Type A partitions of n in the sense of Auluck (1951).at n=20A001522
- Numbers n such that (10^n + 1)/11 is a prime.at n=6A001562
- Numbers k such that 19*2^k - 1 is prime.at n=11A001775
- Numbers k such that phi(2k-1) < phi(2k), where phi is Euler's totient function A000010.at n=4A001836
- Cyclic numbers: 10 is a quadratic residue modulo p and class of mantissa is 2.at n=17A001914
- Primes p such that the congruence 2^x == 3 (mod p) is solvable.at n=34A001915
- Primes p such that the congruence 2^x = 5 (mod p) is solvable.at n=33A001916
- Let p = n-th odd prime. Then a(n) = least prime congruent to 5 modulo 8 such that Legendre(a(n), q) = -1 for all odd primes q <= p.at n=4A001992
- a(n) = least value of m for which Liouville's function A002819(m) = -n.at n=21A002053
- Pythagorean primes: primes of the form 4*k + 1.at n=28A002144
- Numbers k for which the rank of the elliptic curve y^2 = x^3 - k is 2.at n=38A002154