101
1. One hundred one is a sexy prime as well as a sexy prime triplet. Sexy primes differ from each other by 6. If p is a prime and p + 6 is also a prime then it is called a sexy prime.
Example:- (5,11), (7,13), (11,17), (13,19), (17,23), (23,29), (31,37), (37,43), (41,47), (47,53), (53,59), (61,67), (67,73), (73,79), (83,89), (97,103), (101,107)
2. 101 is also a sexy prime triplet. If p, p+6 and p + 12 are all prime then it is called sexy prime triplet.
Example:- (5,11,17), (7,13,19), (17,23,29), (31,37,43), (47,53,59), (67,73,79), (97,103,109), (101,107,113),
3. It is the sum of 5 consecutive primes
13 + 17 + 19 + 23 + 29
4. It can be written as the sum of first 5 factorial with alternate sign.
101 = 5! - 4! + 3! - 2! + 1!
5. It is a palindrome number and a palindrome prime.
6. It is the largest prime in form of 10^n + 1
101 = 10^2 + 1
7. There are 101 digits in the product of the 39 successive primes produced by the formula n2 + n + 41, where n = 1 to 39. This formula was used by Charles Babbage to demonstrate the capabilities of his Difference Engine (1819-1822))
Happy reading
Dr Rajesh Kumar Thakur
1. One hundred one is a sexy prime as well as a sexy prime triplet. Sexy primes differ from each other by 6. If p is a prime and p + 6 is also a prime then it is called a sexy prime.
Example:- (5,11), (7,13), (11,17), (13,19), (17,23), (23,29), (31,37), (37,43), (41,47), (47,53), (53,59), (61,67), (67,73), (73,79), (83,89), (97,103), (101,107)
2. 101 is also a sexy prime triplet. If p, p+6 and p + 12 are all prime then it is called sexy prime triplet.
Example:- (5,11,17), (7,13,19), (17,23,29), (31,37,43), (47,53,59), (67,73,79), (97,103,109), (101,107,113),
3. It is the sum of 5 consecutive primes
13 + 17 + 19 + 23 + 29
4. It can be written as the sum of first 5 factorial with alternate sign.
101 = 5! - 4! + 3! - 2! + 1!
5. It is a palindrome number and a palindrome prime.
6. It is the largest prime in form of 10^n + 1
101 = 10^2 + 1
7. There are 101 digits in the product of the 39 successive primes produced by the formula n2 + n + 41, where n = 1 to 39. This formula was used by Charles Babbage to demonstrate the capabilities of his Difference Engine (1819-1822))
Happy reading
Dr Rajesh Kumar Thakur