193
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 194
- 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
- 192
- Möbius Function
- -1
- Radical
- 193
- 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
- 119
- Smith Number
- no
Primality
- Prime
- yes
- Composite Number
- no
- Semiprime
- no
- Squarefree Number
- yes
- Prime Power
- yes
- Prime Factorization
- no
- Twin Prime
- yes
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 44
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Names
- German
- einshundertdreiundneunzig· ordinal: einshundertdreiundneunzigste
- English
- one hundred ninety-three· ordinal: one hundred ninety-third
- Spanish
- ciento noventa y tres· ordinal: 193º
- French
- cent quatre-vingt-treize· ordinal: cent quatre-vingt-treizième
- Italian
- centonovantatre· ordinal: 193º
- Latin
- centum nonaginta tres· ordinal: 193.
- Portuguese
- cento e noventa e três· ordinal: 193º
Appears in sequences
- Tribonacci numbers: a(n) = a(n-1) + a(n-2) + a(n-3) with a(0)=a(1)=a(2)=1.at n=10A000213
- Nearest integer to modified Bessel function K_n(5).at n=12A000249
- Primes and squares of primes.at n=49A000430
- A Beatty sequence: [ n(e+1) ].at n=51A000572
- Number of nonnegative solutions to x^2 + y^2 <= n^2.at n=15A000603
- n-th superior highly composite number A002201(n) is product of first n terms of this sequence.at n=66A000705
- Primes p of the form 3k+1 such that -sqrt(p) < sum_{x=1..p} cos(2*Pi*x^3/p) < sqrt(p).at n=6A000922
- Lucky numbers.at n=37A000959
- Powers of primes. Alternatively, 1 and the prime powers (p^k, p prime, k >= 1).at n=58A000961
- Number of 3-line partitions of n.at n=9A000991
- Numbers k such that sum of squares of k consecutive integers >= 1 is a square.at n=24A001032
- Numbers n such that the sum of the squares of n consecutive positive odd numbers x^2 + (x+2)^2 + ... + (x+2n-2)^2 = k^2 for some integer k. The least values of x and k for each n are in A056131 and A056132, respectively.at n=14A001033
- Numbers m such that Sum_{k=0..m-1} exp(2*Pi*i*k^3/m) != 0.at n=51A001074
- Union of all numbers {p, q} where p and q are both primes or powers of primes and q = p+2.at n=42A001092
- Twin primes.at n=26A001097
- Primes with 5 as smallest primitive root.at n=7A001124
- Primes == +-1 (mod 8).at n=18A001132
- Bessel polynomials y_n(x) (see A001498) evaluated at 2.at n=3A001517
- Related to Gilbreath conjecture.at n=11A001549
- a(0) = 1, a(1) = 4; thereafter a(n)*(2n + 10) - a(n-1)*(11n + 35) + a(n-2)*(8n + 2) + a(n-3)*(15n + 7) + a(n-4)*(4n - 2) = 0.at n=4A001559