Search a number
-
+
101000101151 is a prime number
BaseRepresentation
bin101111000010000010…
…0110011110100011111
3100122200212111202010002
41132010010303310133
53123322011214101
6114222050404515
710203606460205
oct1360404636437
9318625452102
10101000101151
1139919a18984
12176a889073b
1396a7a83981
144c61bd7075
152961e3ad6b
hex1784133d1f

101000101151 has 2 divisors, whose sum is σ = 101000101152. Its totient is φ = 101000101150.

The previous prime is 101000101127. The next prime is 101000101177. The reversal of 101000101151 is 151101000101.

It is a happy number.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 101000101151 - 214 = 101000084767 is a prime.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (101000103151) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50500050575 + 50500050576.

It is an arithmetic number, because the mean of its divisors is an integer number (50500050576).

Almost surely, 2101000101151 is an apocalyptic number.

101000101151 is a deficient number, since it is larger than the sum of its proper divisors (1).

101000101151 is an equidigital number, since it uses as much as digits as its factorization.

101000101151 is an odious number, because the sum of its binary digits is odd.

The product of its (nonzero) digits is 5, while the sum is 11.

Adding to 101000101151 its reverse (151101000101), we get a palindrome (252101101252).

It can be divided in two parts, 101000101 and 151, that multiplied together give a palindrome (15251015251).

The spelling of 101000101151 in words is "one hundred one billion, one hundred one thousand, one hundred fifty-one".