5234
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 7854
- Proper Divisor Sum (Aliquot Sum)
- 2620
- 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
- 2616
- Möbius Function
- 1
- Radical
- 5234
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 2
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
- 85
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- Atkinson-Negro-Santoro sequence: a(n+1) = 2*a(n) - a(n-floor(n/2+1)).at n=14A005255
- Numbers n such that n is a substring of its square in base 3 (written in base 10).at n=22A018827
- Cycle class sequence c(2n) (the number of true cycles of length 2n in which a certain node is included) for zeolite DFO = DAF-1 [Mg14Al52P66O264].7R.40H2O starting with a T1 atom.at n=5A019007
- Numbers k such that the continued fraction for sqrt(k) has period 13.at n=31A020352
- a(n) = floor( Sum_{1 <= i < j <= n} ((sqrt(j)-sqrt(i))^3) ).at n=31A025197
- Complete list of solutions to y^2 = x^3 + 17; sequence gives x values.at n=7A029728
- Dimension of the space of weight n cuspidal newforms for Gamma_1( 69 ).at n=40A063342
- Let u(1) = u(2) = v(1) = v(2) = 1, u(n+2) = u(n)+v(n+1), v(n+2) = abs(u(n)-v(n+1)), then a(n) = u(n).at n=44A072515
- Let u(1) = u(2) = v(1) = v(2) = 1, u(n+2) = u(n)+v(n+1), v(n+2) = abs(u(n)-v(n+1)), then a(n) = u(n).at n=47A072515
- Coefficients of a power series whose convolution consists of only the even-indexed terms of the sequence.at n=36A073707
- Coefficients of a power series whose convolution consists of only the even-indexed terms of the sequence.at n=37A073707
- Generating function A(x) satisfies A(x) = (1+x)^2*A(x^2)^2, with A(0)=1.at n=18A073708
- Good examples of Hall's conjecture: integers x such that 0 < |x^3 - y^2| < sqrt(x) for some integer y.at n=1A078933
- G.f.: Product_{m>=1} 1/(1-x^m)^A018819(m).at n=15A089292
- a(n) = ceiling((sqrt n)^(sqrt n)).at n=26A094093
- The first pair of digits sums up to 7. So does the second pair. And the third one and the fourth one, etc., with a(n) < a(n+1). When constructing the sequence, choose the next digits so as to slow the growth of the sequence as much as possible.at n=61A101325
- Numbers k such that the concatenation of k with k-9 gives a square.at n=1A115436
- Complete list of solutions to y^2 = x^3 + 17; sequence gives x values.at n=7A124439
- Numbers n such that primorial(n)/2 + 64 is prime.at n=12A139447
- Number of sets (in the Hausdorff metric geometry) at each location between two sets defining a polygonal configuration consisting of two m-gonal polygonal components chained with string components of length 1 as m varies.at n=2A152928