541
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 10
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 542
- 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
- 540
- Möbius Function
- -1
- Radical
- 541
- 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
- 43
- 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
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 100
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Names
- German
- fünfhunderteinundvierzig· ordinal: fünfhunderteinundvierzigste
- English
- five hundred forty-one· ordinal: five hundred forty-first
- Spanish
- quinientos cuarenta y uno· ordinal: 541º
- French
- cinq cent quarante et un· ordinal: cinq cent quarante et unième
- Italian
- cinquecentoquarantuno· ordinal: 541º
- Latin
- quingenti quadraginta unus· ordinal: 541.
- Portuguese
- quinhentos e quarenta e um· ordinal: 541º
Appears in sequences
- Record gaps between primes (upper end) (compare A002386, which gives lower ends of these gaps).at n=6A000101
- A nonlinear binomial sum.at n=10A000128
- Fubini numbers: number of preferential arrangements of n labeled elements; or number of weak orders on n labeled elements; or number of ordered partitions of [n].at n=5A000670
- Primes p of the form 3k+1 such that sum_{x=1..p} cos(2*Pi*x^3/p) < -sqrt(p).at n=7A000923
- 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=29A000928
- Primes with primitive root 2.at n=40A001122
- Smallest prime p such that there is a gap of 2n between p and previous prime.at n=8A001632
- Expansion of 1/((1+x)*(1-x)^10).at n=4A001781
- The coding-theoretic function A(n,4,3).at n=57A001839
- Full reptend primes: primes with primitive root 10.at n=37A001913
- Primes p such that the congruence 2^x = 5 (mod p) is solvable.at n=55A001916
- Pythagorean primes: primes of the form 4*k + 1.at n=46A002144
- Primes of the form 2^q*3^r*5^s + 1.at n=27A002200
- Primes congruent to 1 or 2 modulo 4; or, primes of form x^2 + y^2; or, -1 is a square mod p.at n=47A002313
- Primes of the form 6m + 1.at n=46A002476
- Numbers k such that (k^2 + k + 1)/21 is prime.at n=28A002644
- Sextan primes: p = (x^6 + y^6)/(x^2 + y^2).at n=5A002647
- Centered 12-gonal numbers, or centered dodecagonal numbers: numbers of the form 6*k*(k-1) + 1.at n=9A003154
- Add 4, then reverse digits; start with 0.at n=25A003608
- Primes p == +- 3 (mod 8), or, primes p such that 2 is not a square mod p.at n=51A003629