10139
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
- 10140
- 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
- 10138
- Möbius Function
- -1
- Radical
- 10139
- 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
- 60
- 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
- 1244
- 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 even period and if the last term of the periodic part is deleted the central term is 99.at n=31A031597
- Sum of the lengths of the cycle types of the permutation created by length sorting on the partitions of n.at n=32A036056
- Concatenate n-th prime and n-th composite.at n=25A038530
- Primes that are concatenations of k-th prime and k-th composite.at n=3A038531
- Numbers whose base-10 representation has exactly 5 runs.at n=26A043641
- Number of anagrams of a(n) that are prime increases.at n=10A046888
- a(n) is the least integer that has exactly n anagrams that are primes.at n=14A046890
- Values of n where number of permutations of digits a(n) that are prime increases.at n=13A046891
- a(n) is the least number with exactly n permutations of digits that are primes.at n=22A046893
- Sequence of 2 Pythagorean triangles, each with a leg and hypotenuse prime. The leg of the second triangle is the hypotenuse of the first.at n=35A048270
- n^a(n) is the smallest power of n (with a(n) > 1) which starts with n.at n=53A051248
- Primes p such that x^37 = 2 has no solution mod p.at n=35A059223
- a(1) = 2; a(n+1) is the smallest prime > a(n) which differs from it in every digit.at n=31A068853
- First prime > 10^n in which every substring of length n is prime.at n=3A070024
- Primeval numbers: numbers that set a record for the number of distinct primes that can be obtained by permuting some subset of their digits.at n=16A072857
- Primes p such that 13 is the largest of all prime factors of the numbers between p and the next prime (cf. A052248).at n=16A080188
- a(1) = 1; then the smallest number such that both the forward and reverse n-th partial concatenation is a prime for n > 1. (Reverse concatenation is taken term-wise and not digit-wise.)at n=45A083992
- Smallest member of a pair of consecutive twin prime pairs that have exactly n primes between them.at n=14A089637
- Triangle, read by rows, where T(n,k) equals the least m>0 that produces the maximum number of partial quotients in the simple continued fraction expansion of (1/n + 1/k + 1/m).at n=42A091943
- a(n) is the smallest integer m such that A039995(m)=n.at n=13A094535