12703
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
- 12704
- 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
- 12702
- Möbius Function
- -1
- Radical
- 12703
- 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
- 143
- 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
- 1517
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 62 ones.at n=25A031830
- Primes p such that p^12 reversed is also prime.at n=37A059705
- Minimal positive solution a(n) of Diophantine equation a(n)^2 - a(n)*b(n) - G(n)*b(n)^2 = +1 or -1 with G(n) := A078358(n). The companion sequence is b(n)=A077058(n).at n=34A077057
- Primes such that the next n successive differences are identical.at n=13A087562
- a(1) = 2 then primes in nondecreasing order such that every concatenation is prime.at n=34A089702
- a(n) = (n+1)*prime(n) + n*prime(n+1).at n=37A097240
- Primes of the form (k+1)*prime(k) + k*prime(k+1).at n=16A097241
- Primes of the form [prime(n)*prime(n+1)+p]/2 with increasing p.at n=34A100558
- Primes congruent to 12 mod 37.at n=40A142121
- Primes congruent to 34 mod 41.at n=41A142231
- Primes congruent to 18 mod 43.at n=33A142267
- Primes congruent to 13 mod 47.at n=31A142364
- Primes congruent to 12 mod 49.at n=30A142424
- Primes congruent to 36 mod 53.at n=22A142566
- Primes congruent to 53 mod 55.at n=40A142639
- Primes congruent to 49 mod 57.at n=39A142695
- Primes congruent to 18 mod 59.at n=29A142745
- Primes congruent to 15 mod 61.at n=27A142813
- a(n) = 15n^2 + 3n + 1.at n=28A165806
- Primes p such that 2*p+3, 4*p+9 and 16*p+45 are also prime.at n=42A175159