263
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 11
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 264
- 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
- 262
- Möbius Function
- -1
- Radical
- 263
- 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
- 78
- 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
- no
- Safe Prime
- yes
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 56
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Names
- German
- zweihundertdreiundsechzig· ordinal: zweihundertdreiundsechzigste
- English
- two hundred sixty-three· ordinal: two hundred sixty-third
- Spanish
- doscientos sesenta y tres· ordinal: 263º
- French
- deux cent soixante-trois· ordinal: deux cent soixante-troisième
- Italian
- duecentosessantatre· ordinal: 263º
- Latin
- ducenti sexaginta tres· ordinal: 263.
- Portuguese
- duzentos e sessenta e três· ordinal: 263º
Appears in sequences
- Primes p == 7, 19, 23 (mod 40) such that (p-1)/2 is also prime.at n=6A000353
- Number of primes < prime(n)^2.at n=12A000879
- 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=10A000928
- Primes with 5 as smallest primitive root.at n=8A001124
- Primes == +-1 (mod 8).at n=25A001132
- Number of cells of square lattice of edge 1/n inside quadrant of unit circle centered at 0.at n=18A001182
- a(n) = floor(n*log((14/11)*n^(10/9))).at n=55A001195
- Number of 5-line partitions of n.at n=9A001452
- Numbers k such that phi(2k-1) < phi(2k), where phi is Euler's totient function A000010.at n=3A001836
- Full reptend primes: primes with primitive root 10.at n=21A001913
- Primes p such that the congruence 2^x == 3 (mod p) is solvable.at n=32A001915
- v-pile positions of the 4-Wythoff game with i=1.at n=50A001964
- Prime determinants of forms with class number 2.at n=27A002052
- Primes of the form 4*k + 3.at n=29A002145
- Primitive roots that go with the primes in A002230.at n=30A002229
- Primitive roots that go with the primes in A029932.at n=15A002231
- Let p = A007645(n) be the n-th generalized cuban prime and write p^2 = x^2 + 3*y^2 with y > 0; a(n) = x.at n=42A002367
- Let p = A007645(n) be the n-th generalized cuban prime and write p^2 = x^2 + 3*y^2 with y > 0; a(n) = x.at n=50A002367
- Numerators of coefficients for repeated integration.at n=4A002681
- Numbers k such that (k^2 + 1)/10 is prime.at n=25A002733