Search a number
-
+
311257100556223 is a prime number
BaseRepresentation
bin100011011000101100011000…
…0111010011001011110111111
31111211001212222111122202021121
41012301120300322121132333
5311244114020220244343
63021553312113011411
7122363404053432313
oct10661306072313677
91454055874582247
10311257100556223
11901a3438898668
122aaab865253b67
131048a55999a6c3
1456c0cd1833b43
1525eb7a13b0aed
hex11b1630e997bf

311257100556223 has 2 divisors, whose sum is σ = 311257100556224. Its totient is φ = 311257100556222.

The previous prime is 311257100556221. The next prime is 311257100556271. The reversal of 311257100556223 is 322655001752113.

It is a happy number.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 311257100556223 - 21 = 311257100556221 is a prime.

Together with 311257100556221, 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 311257100556223.

It is a congruent number.

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

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

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

Almost surely, 2311257100556223 is an apocalyptic number.

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

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

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

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

The spelling of 311257100556223 in words is "three hundred eleven trillion, two hundred fifty-seven billion, one hundred million, five hundred fifty-six thousand, two hundred twenty-three".