5262
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 10536
- Proper Divisor Sum (Aliquot Sum)
- 5274
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 1752
- Möbius Function
- -1
- Radical
- 5262
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 3
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
- 191
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- yes
- 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
Classification
- Even
- yes
- Odd
- no
Appears in sequences
- Pentagonal numbers written backwards.at n=42A004163
- Coordination sequence T3 for Zeolite Code EUO.at n=45A008098
- Coordination sequence T3 for Zeolite Code MFS.at n=45A008175
- Molien series for alternating group Alt_12 (or A_12).at n=31A008635
- Number of partitions of n into at most 12 parts.at n=31A008641
- Integers that are squarefree and also the sum of first k squarefrees for some k.at n=48A013932
- Triangle, T(n, k): T(n,k) = 1 for n < 3, T(3,1) = T(3,2) = T(3,3) = 2, T(n,0) = 1, T(n,1) = n-1, T(n,n) = T(n-1,n-2) + T(n-1,n-1), otherwise T(n,k) = T(n-1,k-2) + T(n-1,k-1) + T(n-1,k), read by rows.at n=76A026268
- Number of (s(0), s(1), ..., s(n)) such that every s(i) is a nonnegative integer, s(0) = 0, s(1) = 1 = s(n), |s(i) - s(i-1)| <= 1 for i >= 2, |s(2) - s(1)| = 1, |s(3) - s(2)| = 1 if s(2) = 1. Also T(n,n-1), where T is the array in A026268.at n=9A026270
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 48.at n=18A031546
- Number of partitions of n into parts not of the form 25k, 25k+5 or 25k-5. Also number of partitions with at most 4 parts of size 1 and differences between parts at distance 11 are greater than 1.at n=31A036004
- Consider the Diophantine equation x^3 + y^3 = z^3 + 1 (1 < x < y < z) or 'Fermat near misses'. Sequence gives values of z in monotonic increasing order.at n=11A050791
- Composite numbers k for which phi(k) + sigma(k) is an integer multiple of the 4th power of the number of divisors of k.at n=22A055468
- Least k such that k*7^n +/- 1 are twin primes.at n=32A064217
- Natural numbers written out with their digits grouped in sets of four (leading zeros omitted).at n=10A091332
- Expansion of x(1-2x-2x^2)/((1+x)(1-2x)(1-3x)).at n=10A093379
- Initial values for iteration of the function f(x) = A063919(x) such that the iteration ends in a 14-cycle, i.e., in A097030.at n=41A097034
- Number of painted forests - exactly one of its trees is painted - on labeled vertex set [n].at n=5A101313
- Matrix inverse of triangle A104559, read by rows.at n=29A104560
- The smallest part summed over all partitions of n in which every integer from the smallest part to the largest part occurs.at n=49A117467
- Subsequence of A050791, "Fermat near misses", generated by iteration of a linear form derived from Ramanujan's parametric formula for equal sums of two pairs of cubes.at n=0A143936