Search a number
-
+
102000311311267 is a prime number
BaseRepresentation
bin10111001100010011001100…
…010100101001101110100011
3111101011010122001221122000201
4113030103030110221232203
5101332133114143430032
61000534143544130031
730325164541560325
oct2714231424515643
9441133561848021
10102000311311267
112a5560a86577a6
12b534415a66917
1344bb785038765
141b28bacb7b615
15bbd3dec928e7
hex5cc4cc529ba3

102000311311267 has 2 divisors, whose sum is σ = 102000311311268. Its totient is φ = 102000311311266.

The previous prime is 102000311311253. The next prime is 102000311311321. The reversal of 102000311311267 is 762113113000201.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 102000311311267 - 27 = 102000311311139 is a prime.

It is a super-2 number, since 2×1020003113112672 (a number of 29 digits) contains 22 as substring.

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

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

Almost surely, 2102000311311267 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 1512, while the sum is 28.

Adding to 102000311311267 its reverse (762113113000201), we get a palindrome (864113424311468).

The spelling of 102000311311267 in words is "one hundred two trillion, three hundred eleven million, three hundred eleven thousand, two hundred sixty-seven".