52
domain: N
Properties
Digital Properties
- Digit Count
- 2
- Digit Sum
- 7
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 98
- Proper Divisor Sum (Aliquot Sum)
- 46
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- yes
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 24
- Möbius Function
- 0
- Radical
- 26
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 2
Special
- Factorial
- no
- Catalan Number
- no
- Bell Number
- yes
- 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
- yes
- Odd
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- Prime Power
- no
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Names
- German
- zweiundfünfzig· ordinal: zweiundfünfzigste
- English
- fifty-two· ordinal: fifty-second
- Spanish
- cincuenta y dos· ordinal: 52º
- French
- cinquante-deux· ordinal: cinquante-deuxième
- Italian
- cinquantadue· ordinal: 52º
- Latin
- quinquaginta duo· ordinal: 52.
- Portuguese
- cinquenta e dois· ordinal: 52º
Appears in sequences
- Number of groups of order n.at n=48A000001
- Number of groups of order n.at n=80A000001
- Number of ways of making change for n cents using coins of 1, 2, 5, 10 cents.at n=23A000008
- Euler totient function phi(n): count numbers <= n and prime to n.at n=52A000010
- a(n) is the number of distinct (infinite) output sequences from binary n-stage shift register which feeds back the complement of the last stage.at n=10A000016
- Mosaic numbers or multiplicative projection of n: if n = Product (p_j^k_j) then a(n) = Product (p_j * k_j).at n=51A000026
- The positive integers. Also called the natural numbers, the whole numbers or the counting numbers, but these terms are ambiguous.at n=51A000027
- Numbers that are not squares (or, the nonsquares).at n=44A000037
- 1-digit numbers arranged in alphabetical order, then the 2-digit numbers arranged in alphabetical order, then the 3-digit numbers, etc.at n=32A000052
- A Beatty sequence: a(n) = floor(n/(e-2)).at n=37A000062
- Odious numbers: numbers with an odd number of 1's in their binary expansion.at n=26A000069
- a(n) = floor(n^(3/2)).at n=14A000093
- Bell or exponential numbers: number of ways to partition a set of n labeled elements.at n=5A000110
- Number of simple triangulations of the plane with n nodes.at n=6A000256
- Sums of three squares: numbers of the form x^2 + y^2 + z^2.at n=45A000378
- Numbers where total number of 1-bits in the exponents of their prime factorization is even; a 2-way classification of integers: complement of A000028.at n=27A000379
- Numbers of form x^2 + y^2 + 7z^2.at n=42A000394
- Numbers of form x^2 + 2y^2 + 2yz + 4z^2.at n=47A000398
- Numbers of form x^2 + y^2 + 2*z^2.at n=49A000401
- Numbers that are the sum of 2 nonzero squares.at n=18A000404