5297
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 5298
- Proper Divisor Sum (Aliquot Sum)
- 1
- 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
- 5296
- Möbius Function
- -1
- Radical
- 5297
- Omega Function (Ω)
- 1
- Little Omega Function (ω)
- 1
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
- 98
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- yes
- Composite Number
- no
- Semiprime
- no
- Squarefree Number
- yes
- Prime Power
- yes
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 702
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Primes p == 1 (mod 8), p = a^2 +64*b^2 such that y^2 = x^3 + p*x has rank 0.at n=25A007765
- Numbers k such that the continued fraction for sqrt(k) has period 7.at n=38A010338
- a(n) = floor(n*(n-1)*(n-2)/15).at n=44A011897
- Smallest nontrivial extension of n-th square which is a prime.at n=22A030685
- Upper prime of a difference of 16 between consecutive primes.at n=17A031935
- Primes of form x^2+59*y^2.at n=30A033238
- Let a (resp. b,c,d) be number of primes in the range {2..p} that end in 1 (resp. 3,7,9); sequence gives p such that a=d and b=c.at n=36A038562
- Number of partitions satisfying cn(0,5) <= cn(1,5) + cn(4,5).at n=30A039839
- Numerators of continued fraction convergents to sqrt(46).at n=9A041078
- Smallest of three consecutive primes with a difference of 6: primes p such that p+6 and p+12 are the next two primes.at n=37A047948
- Integers n such that A047988(n)=3.at n=24A047986
- a(n)=T(n,2), array T as in A049735.at n=41A049745
- a(n) is the smallest integer such that the sum of any three ordered terms a(k), k <= n, is unique.at n=16A051912
- Primes p from A031924 such that A052180(primepi(p)) = 7.at n=28A052231
- Numbers k such that 3^k - 2^k is prime.at n=17A057468
- a(n) is the least nonnegative integer k such that 2^n - k is a safe prime.at n=45A057821
- Primes p such that x^16 = 2 has no solution mod p, but x^8 = 2 has a solution mod p.at n=9A059287
- a(n) is the least odd number of the form p + k^2 with p prime and k > 0 which can be represented in exactly n different ways.at n=31A059400
- Primes p such that x^48 = 2 has no solution mod p, but x^24 = 2 has a solution mod p.at n=6A059669
- Primes p such that p^11 reversed is also prime.at n=22A059704