Search a number
-
+
151555514025103 is a prime number
BaseRepresentation
bin100010011101011011000100…
…100100111100010010001111
3201212121120021100112121012221
4202131123010210330102033
5124331041143042300403
61254155350400040211
743631344630621546
oct4235330444742217
9655546240477187
10151555514025103
1144321372694341
1214bb8583003067
136674815206886
14295d47c84115d
15127c4902addbd
hex89d6c493c48f

151555514025103 has 2 divisors, whose sum is σ = 151555514025104. Its totient is φ = 151555514025102.

The previous prime is 151555514025101. The next prime is 151555514025133. The reversal of 151555514025103 is 301520415555151.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 151555514025103 - 21 = 151555514025101 is a prime.

Together with 151555514025101, it forms a pair of twin primes.

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

It is a congruent number.

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

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

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

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

Almost surely, 2151555514025103 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 375000, while the sum is 43.

The spelling of 151555514025103 in words is "one hundred fifty-one trillion, five hundred fifty-five billion, five hundred fourteen million, twenty-five thousand, one hundred three".