12659
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 12660
- 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
- 12658
- Möbius Function
- -1
- Radical
- 12659
- 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
- 156
- 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
- yes
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 1513
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Successive states of the Rule 110 cellular automaton defined by 000, 001, 010, 011, ..., 111 -> 0,1,1,1,0,1,1,0 when started with a single ON cell.at n=13A006978
- Numbers k such that the continued fraction for sqrt(k) has period 86.at n=35A020425
- Primes of form n^2 + n + 3.at n=15A027753
- Lists of 4 primes in arithmetic progression; common difference 6.at n=31A033449
- Last member of a sexy prime quadruple: value of p+18 such that p, p+6, p+12 and p+18 are all prime.at n=26A046124
- Fourth term of balanced prime quartets: p(m-2)-p(m-3) = p(m-1)-p(m-2) = p(m)-p(m-1).at n=7A054803
- a(n) = a(n-1) + a(n - 1 minus the number of terms of a(k) == (mod 5) so far).at n=28A060732
- Safe primes (A005385) (p and (p-1)/2 are primes) such that 8*p+1 (A023228) is also prime.at n=34A075706
- Safe primes (A005385) (p and (p-1)/2 are primes) such that 12*p+1 is also prime.at n=33A075707
- a(n) = prime(2*n*(n+1)+1).at n=27A078746
- First prime after phi(prime(n)^2).at n=29A079477
- Numbers p such that p = (prime(n)+ prime(n+3))/2 is prime for prime indices n=2, 3, 5...at n=18A098039
- a(n) = floor(n^(n/3)/n!!!).at n=33A114863
- Numbers n such that in the 3 X 3 square arrangement of the 9 primes p(n),..,p(n+8), totals of 3 rows and 3 columns, are all prime.at n=3A115050
- a(n) = (n^5 - 133*n^4 + 6729*n^3 - 158379*n^2 + 1720294*n - 6823316)/4.at n=16A121887
- Primes of the form 210k + 59.at n=31A140852
- a(n) = prime(2*n^2) - 2*n^2.at n=28A141086
- Primes congruent to 5 mod 37.at n=42A142114
- Primes congruent to 31 mod 41.at n=41A142228
- Primes congruent to 17 mod 43.at n=39A142266