12689
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 26
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 12690
- 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
- 12688
- Möbius Function
- -1
- Radical
- 12689
- 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
- 81
- 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
- 1515
- 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 period 89.at n=12A020428
- Number of partitions of n with equal nonzero number of parts congruent to each of 0 and 1 (mod 4).at n=49A035546
- Primes p such that x^61 = 2 has no solution mod p.at n=26A059230
- Smallest prime having exactly n representations as a^2+b^2+c^2 with c >= b >= a > 0.at n=41A094714
- Primes of the form a^5 + b^3 with a,b>0.at n=20A100273
- Number of partitions of n such that the numbers of prime and composite parts differ by at least 1.at n=44A116450
- Primes of the form a^2 + b^2 + c^2 such that a^4 + b^4 + c^4 is prime as well and larger than the first one.at n=29A126118
- Smallest n-digit emirp (A006567) with strictly increasing (distinct) digits.at n=3A127747
- Primes of the form 2*3*5*7*k+89, k >= 0.at n=28A141866
- Primes congruent to 20 mod 41.at n=37A142217
- Primes congruent to 4 mod 43.at n=34A142253
- Primes congruent to 46 mod 47.at n=30A142397
- Primes congruent to 47 mod 49.at n=35A142454
- Primes congruent to 22 mod 53.at n=26A142552
- Primes congruent to 39 mod 55.at n=36A142629
- Primes congruent to 4 mod 59.at n=24A142731
- Primes congruent to 26 mod 63.at n=39A142904
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, 0, 1), (-1, 1, 1), (0, 1, 1), (1, -1, 0), (1, 0, -1)}.at n=8A149065
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, -1), (-1, 0, 1), (0, 1, 0), (1, 0, 0), (1, 1, 0)}.at n=7A151086
- Primes p of the form : (p-n)/(n+1)=prime and (n+1)*p+n=prime. n=2.at n=42A152292