53
domain: N
Properties
Digital Properties
- Digit Count
- 2
- Digit Sum
- 8
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 54
- 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
- 52
- Möbius Function
- -1
- Radical
- 53
- 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
- 11
- Smith Number
- no
Classification
- Natural
- yes
- Even
- no
- Odd
- yes
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
- 16
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Names
- German
- dreiundfünfzig· ordinal: dreiundfünfzigste
- English
- fifty-three· ordinal: fifty-third
- Spanish
- cincuenta y tres· ordinal: 53º
- French
- cinquante-trois· ordinal: cinquante-troisième
- Italian
- cinquantatre· ordinal: 53º
- Latin
- quinquaginta tres· ordinal: 53.
- Portuguese
- cinquenta e três· ordinal: 53º
Appears in sequences
- Smallest prime power >= n.at n=49A000015
- Smallest prime power >= n.at n=50A000015
- Smallest prime power >= n.at n=51A000015
- Smallest prime power >= n.at n=52A000015
- Mosaic numbers or multiplicative projection of n: if n = Product (p_j^k_j) then a(n) = Product (p_j * k_j).at n=52A000026
- The positive integers. Also called the natural numbers, the whole numbers or the counting numbers, but these terms are ambiguous.at n=52A000027
- Let k = p_1^e_1 p_2^e_2 p_3^e_3 ... be the prime factorization of n. Sequence gives k such that the sum of the numbers of 1's in the binary expansions of e_1, e_2, e_3, ... is odd.at n=24A000028
- Numbers that are not squares (or, the nonsquares).at n=45A000037
- Number of positive integers <= 2^n of the form 3*x^2 + 4*y^2.at n=8A000049
- 1-digit numbers arranged in alphabetical order, then the 2-digit numbers arranged in alphabetical order, then the 3-digit numbers, etc.at n=31A000052
- Numbers k such that (2k)^4 + 1 is prime.at n=17A000059
- Let A(n) = #{(i,j): i^2 + j^2 <= n}, V(n) = Pi*n, P(n) = A(n) - V(n); sequence gives values of n where |P(n)| sets a new record.at n=8A000099
- Positive zeros of Bessel function of order 0 rounded to nearest integer.at n=16A000134
- Lower Wythoff sequence (a Beatty sequence): a(n) = floor(n*phi), where phi = (1+sqrt(5))/2 = A001622.at n=32A000201
- a(8i+j) = 13i + a(j), where 1<=j<=8.at n=32A000202
- A Beatty sequence: floor(n*(e-1)).at n=30A000210
- a(n) = n*a(n-1) + (n-1)*a(n-2), a(0) = 1, a(1) = 1.at n=4A000255
- Remove all factors of 2 from n; or largest odd divisor of n; or odd part of n.at n=52A000265
- 3*n - 2*floor(sqrt(4*n+5)) + 5.at n=22A000277
- Sums of three squares: numbers of the form x^2 + y^2 + z^2.at n=46A000378