10391
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 10392
- 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
- 10390
- Möbius Function
- -1
- Radical
- 10391
- 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
- 104
- 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
- 1273
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Numbers k such that the continued fraction for sqrt(k) has period 88.at n=25A020427
- Primes that remain prime through 3 iterations of function f(x) = 6x + 1.at n=9A023287
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = A023532, t = (Lucas numbers).at n=17A024368
- Numbers whose least quadratic nonresidue (A020649) is 19.at n=2A025027
- Erroneous version of A024368.at n=16A025068
- a(n) = Sum_{k=0..floor(n/2)} T(n-k,k), T given by A026736.at n=19A026746
- Primes q of the form q = 10p + 1, where p is also prime.at n=40A055781
- Numbers k such that 60*R_k + 1 is prime, where R_k = 11...1 is the repunit (A002275) of length k.at n=22A056658
- Numbers k such that k*2^m-1 are composites for all exponents m in the range 0<=m<=k.at n=26A061154
- Primes with 19 as smallest positive primitive root.at n=9A061331
- Numbers n such that n and the n-th prime have the same digits.at n=33A074350
- Primes that are a concatenation of a prime and its first digit.at n=32A085414
- Primes which when added to their own rotation yield a prime.at n=39A086002
- Duplicate of A023287.at n=9A086126
- Upper prime of a difference of 22 between consecutive primes.at n=18A098976
- Expansion of x^2*(2*x^11+2*x^9+2*x^8+x^7+2*x^6+x^5+x^4+x^3-x^2-x-1) / (x^9+x^6+2*x^3-1).at n=35A099206
- Expansion of x^2*(2*x^11+2*x^9+2*x^8+x^7+2*x^6+x^5+x^4+x^3-x^2-x-1) / (x^9+x^6+2*x^3-1).at n=39A099206
- Expansion of x^2*(2*x^11+2*x^9+2*x^8+x^7+2*x^6+x^5+x^4+x^3-x^2-x-1) / (x^9+x^6+2*x^3-1).at n=37A099206
- Numbers k such that 2*R_k + 7 is prime, where R_k = 11...1 is the repunit (A002275) of length k.at n=11A099410
- Primes equal to a sum of primes with differences congruent to (2,4) mod 6.at n=15A104160