10369
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 10370
- 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
- 10368
- Möbius Function
- -1
- Radical
- 10369
- 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
- 86
- 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
- 1272
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Class 1- (or Pierpont) primes: primes of the form 2^t*3^u + 1.at n=25A005109
- Number of partitions of n in which no part occurs just once.at n=54A007690
- Number of 5's in all partitions of n.at n=35A024789
- a(n) = least m such that if r and s in {1/2, 1/4, 1/6, ..., 1/(2*n)} satisfy r < s, then r < k/m < (k+3)/m < s for some integer k.at n=37A024845
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 76 ones.at n=2A031844
- a(n) is smallest prime such that a(n)-1 is a proper multiple of a(n-1)-1, with a(0) = 2.at n=9A057999
- Primes of form 1+(2^a)*(3^b), a>0, b>0.at n=20A058383
- Primes p such that x^16 = 2 has no solution mod p, but x^8 = 2 has a solution mod p.at n=20A059287
- Primes with 13 as smallest positive primitive root.at n=25A061326
- Primes p such that q-p = 22, where q is the next prime after p.at n=18A061779
- Primes such that prime(p) +- pi(p) are simultaneously prime.at n=22A065117
- Odd prime values of sigma(k) - phi(k) taking k in increasing order.at n=41A068419
- Primes p such that x^8 = 2 has a solution mod p, but x^(8^2) = 2 has no solution mod p.at n=25A070184
- Leading diagonal of triangle in A072467.at n=17A072468
- Numbers k such that 1/(1/phi(k) + 1/phi(k+1) + 1/phi(k+2) + 1/phi(k+3)) is an integer.at n=11A073544
- Five-digit distinct-digit primes.at n=8A074671
- Primes of the form m*rad(m)+1, where rad = A007947 (squarefree kernel).at n=32A078324
- Proth primes: primes of the form k*2^m + 1 with odd k < 2^m, m >= 1.at n=36A080076
- Primes prime(k) such that prime(k)*k falls between twin primes.at n=11A080174
- 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=33A080437