Search a number
-
+
151100110061 is a prime number
BaseRepresentation
bin1000110010111001000…
…1001011010011101101
3112110000102111220011122
42030232101023103231
54433423112010221
6153225303430325
713626254513135
oct2145621132355
9473012456148
10151100110061
115909908911a
122534b1553a5
131133046b264
14745591bac5
153de5487eab
hex232e44b4ed

151100110061 has 2 divisors, whose sum is σ = 151100110062. Its totient is φ = 151100110060.

The previous prime is 151100110019. The next prime is 151100110097. The reversal of 151100110061 is 160011001151.

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

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 149223054436 + 1877055625 = 386294^2 + 43325^2 .

It is a cyclic number.

It is not a de Polignac number, because 151100110061 - 26 = 151100109997 is a prime.

It is a congruent number.

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

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

Almost surely, 2151100110061 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 30, while the sum is 17.

The spelling of 151100110061 in words is "one hundred fifty-one billion, one hundred million, one hundred ten thousand, sixty-one".