Search a number
-
+
271000315560151 is a prime number
BaseRepresentation
bin111101100111100100101101…
…100010110000000011010111
31022112112101011221110101000001
4331213210231202300003113
5241010032121240411101
62400211454251032131
7111040061311044202
oct7547445542600327
91275471157411001
10271000315560151
1179392652196381
122648981543b647
13b82a2b27497a8
144acc6b1796939
15214e517d80901
hexf6792d8b00d7

271000315560151 has 2 divisors, whose sum is σ = 271000315560152. Its totient is φ = 271000315560150.

The previous prime is 271000315560127. The next prime is 271000315560181. The reversal of 271000315560151 is 151065513000172.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 271000315560151 - 211 = 271000315558103 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 2271000315560151 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 31500, while the sum is 37.

The spelling of 271000315560151 in words is "two hundred seventy-one trillion, three hundred fifteen million, five hundred sixty thousand, one hundred fifty-one".