Search a number
-
+
151067115047 is a prime number
BaseRepresentation
bin1000110010110001001…
…1010011111000100111
3112102221010102120112002
42030230103103320213
54433341140140142
6153222124315515
713625404201562
oct2145423237047
9472833376462
10151067115047
11590814a2512
12253400a2b9b
1311326687c94
1474513ad4d9
153de261ba32
hex232c4d3e27

151067115047 has 2 divisors, whose sum is σ = 151067115048. Its totient is φ = 151067115046.

The previous prime is 151067114993. The next prime is 151067115167. The reversal of 151067115047 is 740511760151.

151067115047 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 151067115047 - 26 = 151067114983 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 151067115047.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (151067115547) 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, 75533557523 + 75533557524.

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

Almost surely, 2151067115047 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 29400, while the sum is 38.

Adding to 151067115047 its reverse (740511760151), we get a palindrome (891578875198).

The spelling of 151067115047 in words is "one hundred fifty-one billion, sixty-seven million, one hundred fifteen thousand, forty-seven".