5359
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 5616
- Proper Divisor Sum (Aliquot Sum)
- 257
- 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
- 5104
- Möbius Function
- 1
- Radical
- 5359
- 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
- 191
- 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
- no
- Odd
- yes
Appears in sequences
- Juxtapose pairs of primes (starting at 1).at n=8A007794
- Number of ordered quadruples of integers from [ 1..n ] with no global factor.at n=17A015634
- Number of parts in all partitions of n into distinct parts.at n=39A015723
- Inverse Euler transform of A000931.at n=43A018243
- Fibonacci sequence beginning 0, 23.at n=13A022357
- Convolution of odd numbers and A001950.at n=17A023659
- a(n) = [ 2nd elementary symmetric function of {sqrt(k+1)} ], k = 1,2,...,n.at n=26A025219
- Concatenate the n-th and (n+1)st prime.at n=15A045533
- Numbers k such that k*2^m+1 are composites for all exponents m in the range 0<=m<=k.at n=14A061153
- a(1) = 1; a(n) = smallest multiple of n-th prime (n>1) with all odd digits.at n=50A062280
- Numbers k such that sigma(k) - phi(k) is a cube.at n=27A062385
- Integers for which the smallest m in A040076 such that n*2^m+1 is prime (A050921) increases.at n=11A064699
- Potential Sierpiński numbers: integers for which the smallest m > 2^10 in A040076 such that n*2^m+1 is prime (A050921).at n=16A064721
- First occurrence of n as a term in the continued fraction for Pi/2.at n=50A076587
- Floor(n^3/8).at n=35A081276
- Numbers k such that the k-th prime is of the form 2*j^2 + 1.at n=26A090612
- Denominators of the convergents of the continued fraction expansion [1;1/2,1/3,1/4,...,1/n,...].at n=7A092053
- Concatenations of pairs of primes that differ by 6.at n=10A103206
- Minimum number of moves to solve the second Panex puzzle of order n of exchanging the two side towers.at n=7A109224
- a(n) = 3*n^2 + 27*n + 1.at n=37A110831