10273
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
- 10274
- 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
- 10272
- Möbius Function
- -1
- Radical
- 10273
- 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
- 148
- 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
- 1261
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- exp(arctan(x)*exp(x))=1+x+3/2!*x^2+8/3!*x^3+25/4!*x^4+100/5!*x^5...at n=8A012408
- Lower prime of a pair of consecutive primes having a difference of 16.at n=33A031934
- Numbers with exactly five distinct base-10 digits.at n=24A031987
- a(n) = Sum{a(k): k=0,1,2,...,n-4,n-2,n-1}; a(n-3) is not a summand; initial terms are 1,3,3.at n=15A049871
- Least prime in A031934 (lesser of 16-twins) whose distance to the next 16-twin is 6*n.at n=37A052357
- Prime number spiral (clockwise, Northeast spoke).at n=18A054553
- Primes with 10 as smallest positive primitive root.at n=27A061323
- Five-digit distinct-digit primes.at n=5A074671
- Let p and q be two prime numbers, not necessarily consecutive, such that q - p = 2n; then a(n) is the number of partitions of 2n into even numbers so that each partition corresponds to a consecutive prime difference pattern (k-tuple) and p <= A000230(n).at n=44A079023
- Let f(n,x) = 1 + 2x + 3x^2 + 5x^3 + 7x^4 + ... + prime(n)*x^n; a(n) = smallest prime f(n,x), or 0 if no such prime exists.at n=3A088122
- A variation on Flavius's sieve (A000960): Start with the primes; at the k-th sieving step, remove every (k+1)-st term of the sequence remaining after the (k-1)-st sieving step; iterate.at n=39A099207
- Primes of the form 64n+33.at n=35A105128
- Integers n such that n is prime and x is prime, where (x,y) is the smallest solution to the Pell equation with D = n.at n=15A109748
- Beginning with 3, least member of A007500 such that concatenation of first n terms and its digit reversal both are primes.at n=10A111383
- a(n) = prime(n^2 + n + 1).at n=35A122566
- Primes of the form 33x^2+40y^2.at n=38A140010
- Primes congruent to 7 mod 29.at n=42A141983
- Primes congruent to 24 mod 37.at n=34A142133
- Primes congruent to 23 mod 41.at n=32A142220
- Primes congruent to 39 mod 43.at n=32A142288