10739
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 10740
- 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
- 10738
- Möbius Function
- -1
- Radical
- 10739
- 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
- 73
- 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
- 1310
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Number of n-node animals on b.c.c. lattice.at n=5A007197
- a(n) = floor( n*(n-1)*(n-2)/28 ).at n=68A011910
- Third term of weak prime quintets: p(m-1)-p(m-2) < p(m)-p(m-1) < p(m+1)-p(m) < p(m+2)-p(m+1).at n=24A054825
- Primes p such that x^59 = 2 has no solution mod p.at n=23A059312
- Rounded volume of a regular tetrahedron with edge length n.at n=45A071399
- Five-digit distinct-digit primes.at n=26A074671
- a(n) = 5^n - 4^n - 3^n - 2^n + 3.at n=6A081684
- Numbers k such that 3*10^k + 6*R_k - 5 is prime, where R_k = 11...1 is the repunit (A002275) of length k.at n=16A102974
- Positive integers i for which A112049(i) == 8.at n=11A112068
- Least p=prime(k) for which A118123(k)=n.at n=19A117877
- Primes for which the weight as defined in A117078 is 15 and the gap as defined in A001223 is 14.at n=14A118380
- Primes p such that |100-p|, |1000-p|, |10000-p| and |100000-p| are also primes.at n=17A126021
- Primes with prime "Look And Say" descriptions from right to left (irrespective of method A or method B).at n=27A127179
- a(n) = 4*n^4 + 3*n^3 + 2*n^2 + n + 1.at n=7A130886
- Primes of the form 35x^2+39y^2.at n=39A140026
- Primes of the form 210k + 29.at n=27A140845
- a(n) = prime(2*n^2) - 2*n^2.at n=26A141086
- Primes congruent to 9 mod 37.at n=37A142118
- Primes congruent to 38 mod 41.at n=32A142235
- Primes congruent to 32 mod 43.at n=28A142281