10093
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 10094
- Proper Divisor Sum (Aliquot Sum)
- 1
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 10092
- Möbius Function
- -1
- Radical
- 10093
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 135
- 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
- yes
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 1239
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- A variant of the cuban primes: primes p = (x^3 - y^3)/(x - y) where x = y + 2.at n=11A002648
- Apply partial sum operator 4 times to Fibonacci numbers.at n=13A014166
- Numbers k such that the continued fraction for sqrt(k) has period 65.at n=6A020404
- a(n) = T(2n, n+2), T given by A027935.at n=6A027938
- Smallest prime == 1 mod (n^2).at n=28A035091
- Numerators of continued fraction convergents to sqrt(618).at n=5A042186
- Primes of the form 2*n^2 + 11.at n=38A050265
- Primes p from A031924 such that A052180(p) = 23.at n=11A052238
- For n < 5, a(n) = n-th prime. For n >= 5, let m = n-th prime. If m is a k-digit prime then a(n) = smallest prime obtained by inserting at least one digit between every pair of digits of m. There are (k-1) places where digit insertion takes place and a(n) contains at least 2k-1 digits.at n=26A080437
- a(1) = 13, a(n) is the smallest prime obtained by inserting digits between every pair of digits of a(n-1).at n=2A080440
- Balanced primes of order two.at n=45A082077
- Group the natural numbers so that the n-th group contains n numbers whose sum as well as the group product +1 is prime. Sequence contains the primes arising as the sum of the terms of groups.at n=26A092946
- Initial members of 25 consecutive primes in a 5 X 5 spiral wherein the mean of all 12 sums is prime.at n=23A094458
- Balanced primes of order eight.at n=16A096700
- Primes that do not divide any term of the Lucas 4-step sequence A073817.at n=10A106300
- Primes p such that little googol + p is prime.at n=20A108255
- Primes of the form p = prime(k+1) such that prime(k) = (prime(k+3)+prime(k-1))/2.at n=15A126239
- a(n) is the n-th prime of the form n*x^2+1.at n=11A128970
- Primes in the array A136431 that are not Fibonacci numbers.at n=46A136338
- Least prime P such that 3*p(n)*P*(3*p(n)*P+1)-1, 3*p(n)*P*(3*p(n)*P+1)+1,3*p(n)*P*(3*p(n)*P+3)-1,3*p(n)*P*(3*p(n)*P+3)+1 are all primes with p(i) = i-th prime.at n=24A137839