12289
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 12290
- 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
- 12288
- Möbius Function
- -1
- Radical
- 12289
- 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
- 50
- 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
- 1470
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- A variant of the cuban primes: primes p = (x^3 - y^3)/(x - y) where x = y + 2.at n=12A002648
- Numbers that are the sum of 4 positive 6th powers.at n=31A003360
- a(0) = 1; thereafter a(n) = 3*2^(n-1) + 1.at n=13A004119
- Numbers that are the sum of 7 positive 11th powers.at n=6A004818
- Numbers that are the sum of at most 7 positive 11th powers.at n=34A004913
- Numbers that are the sum of at most 8 positive 11th powers.at n=40A004914
- Class 1- (or Pierpont) primes: primes of the form 2^t*3^u + 1.at n=26A005109
- Numbers k such that the continued fraction for sqrt(k) has odd period and if the last term of the periodic part is deleted then there are a pair of central terms both equal to 8.at n=24A031421
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 76 ones.at n=8A031844
- Smallest prime of form 2^n*k + 1.at n=10A035089
- Smallest prime of form 2^n*k + 1.at n=12A035089
- Smallest prime of form 2^n*k + 1.at n=11A035089
- Smallest prime == 1 mod (n^2).at n=31A035091
- Primes of the form 3*2^k + 1.at n=5A039687
- Minimal 2^n safe-primes: a(n) = 2^n*A051886(n) + 1 (a prime number).at n=12A051900
- Smallest prime p having n different cycles in decimal expansions of k/p, k=1..p-1.at n=31A054471
- Third term of weak prime quintets: p(m-1)-p(m-2) < p(m)-p(m-1) < p(m+1)-p(m) < p(m+2)-p(m+1).at n=27A054825
- a(n) is the least prime p such that p-1 is divisible by 2^n and not by 2^(n+1).at n=12A057775
- Primes of form 1+(2^a)*(3^b), a>0, b>0.at n=21A058383
- Expansion of (1+x^2)*(1+x^5)/( Product_{j=1..7} (1-x^j) ).at n=37A060962