5264
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 20
- Divisor Sum
- 11904
- Proper Divisor Sum (Aliquot Sum)
- 6640
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 2208
- Möbius Function
- 0
- Radical
- 658
- Omega Function (Ω)
- 6
- 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
- 54
- Smith Number
- no
- Vampire Number
- 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
Classification
- Even
- yes
- Odd
- no
Appears in sequences
- Number of n-node rooted trees of height at most 3.at n=16A001383
- Expansion of ( Sum_{n = -infinity..infinity} x^(n^2) )^(-8).at n=4A004409
- Coordination sequence T5 for Zeolite Code VET.at n=43A009906
- exp(arcsin(x)*sin(x))=1+2/2!*x^2+12/4!*x^4+160/6!*x^6+5264/8!*x^8...at n=4A012328
- Numbers having three 2's in base 8.at n=34A043431
- The start of a record-breaking run of consecutive integers with a number of prime factors (counted with multiplicity) equal to 6.at n=1A067821
- Lesser of two consecutive numbers each divisible by a fourth power.at n=11A068782
- Triangle T(n,k) read by rows, where e.g.f. for T(n,k) is exp(x*y)*log(1+x)/(1-x).at n=31A073480
- Smaller of two smallest consecutive numbers with 2n divisors.at n=9A075036
- Numbers k such that 2*k! - 1 is prime.at n=24A076133
- Smallest a(n) > a(n-1) such that a(n)^2+a(n-1)^2 is a perfect square, with a(1)=5.at n=23A076671
- Smallest a(n)>a(n-1) such that a(n)^2+a(n-1)^2 is a perfect square, a(1)=9.at n=23A076674
- Non-balanced numbers in A015769.at n=40A077803
- Expansion of (1-x)/(1-x+x^2+x^3).at n=31A078016
- Expansion of (1-x)/(1 + x + x^2 - x^3).at n=29A078046
- a(n) = sum of n-th row of the triangle pertaining to A079774(n).at n=46A079776
- a(n) = n * [1 + sum(k=1 to n-1) prime(k)].at n=16A083719
- Smaller of two consecutive numbers with the same prime signature not occurring earlier.at n=8A085929
- a(n) = S1(n,2), where S1(n, t) = Sum_{k=0..n} (k^t * Sum_{j=0..k} binomial(n,j)).at n=6A089659
- Triangle read by rows: T(n,k) = number of peakless Motzkin paths of length n containing k UHH...HD's, where U=(1,1), D=(1,-1) and H=(1,0) (can be easily expressed using RNA secondary structure terminology).at n=48A089741