enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Palindromic prime - Wikipedia

    en.wikipedia.org/wiki/Palindromic_prime

    Another beastly palindromic prime is 700666007. [4] Ribenboim defines a triply palindromic prime as a prime p for which: p is a palindromic prime with q digits, where q is a palindromic prime with r digits, where r is also a palindromic prime. [5] For example, p = 10 11310 + 4661664 × 10 5652 + 1, which has q = 11311 digits, and 11311 has r ...

  3. Palindromic number - Wikipedia

    en.wikipedia.org/wiki/Palindromic_number

    The only known non-palindromic number whose cube is a palindrome is 2201, and it is a conjecture the fourth root of all the palindrome fourth powers are a palindrome with 100000...000001 (10 n + 1). Gustavus Simmons conjectured there are no palindromes of form n k for k > 4 (and n > 1).

  4. List of prime numbers - Wikipedia

    en.wikipedia.org/wiki/List_of_prime_numbers

    2.38 Palindromic wing primes. ... for some prime number n. 3, 7, 23, 31, 47, 89 ... The fourth Smarandache-Wellin prime is the 355-digit concatenation of the first ...

  5. 131 (number) - Wikipedia

    en.wikipedia.org/wiki/131_(number)

    131 is a Sophie Germain prime, [1] an irregular prime, [2] the second 3-digit palindromic prime, and also a permutable prime with 113 and 311. It can be expressed as the sum of three consecutive primes, 131 = 41 + 43 + 47. 131 is an Eisenstein prime with no imaginary part and real part of the form 3 n − 1 {\displaystyle 3n-1} .

  6. Strobogrammatic number - Wikipedia

    en.wikipedia.org/wiki/Strobogrammatic_number

    A strobogrammatic prime is a strobogrammatic number that is also a prime number, i.e., a number that is only divisible by one and itself (e.g., 11). [3] It is a type of ambigram, words and numbers that retain their meaning when viewed from a different perspective, such as palindromes. [4]

  7. Reverse divisible number - Wikipedia

    en.wikipedia.org/wiki/Reverse_divisible_number

    In number theory, reversing the digits of a number n sometimes produces another number m that is divisible by n. This happens trivially when n is a palindromic number; the nontrivial reverse divisors are 1089, 2178, 10989, 21978, 109989, 219978, 1099989, 2199978, ... (sequence A008919 in the OEIS).

  8. Repdigit - Wikipedia

    en.wikipedia.org/wiki/Repdigit

    Having an odd prime number of digits is not enough to guarantee that a repunit is prime; for instance, 21 = 111 4 = 3 × 7 and 111 = 111 10 = 3 × 37 are not prime. In any given base b , every repunit prime in that base with the exception of 11 b (if it is prime) is a Brazilian prime.

  9. Happy number - Wikipedia

    en.wikipedia.org/wiki/Happy_number

    The palindromic prime 10 150006 + 7 426 247 × 10 75 000 + 1 is a 10-happy prime with 150 007 digits because the many 0s do not contribute to the sum of squared digits, and 1 2 + 7 2 + 4 2 + 2 2 + 6 2 + 2 2 + 4 2 + 7 2 + 1 2 = 176, which is a 10-happy number. Paul Jobling discovered the prime in 2005. [10]