Search a number
-
+
102031021201 is a prime number
BaseRepresentation
bin101111100000110000…
…1011101010010010001
3100202100201100220120011
41133001201131102101
53132424420134301
6114512234514521
710241265241054
oct1370141352221
9322321326504
10102031021201
113a2a894041a
1217935b95a41
139810528835
144d1cab2a9b
1529c26c8a51
hex17c185d491

102031021201 has 2 divisors, whose sum is σ = 102031021202. Its totient is φ = 102031021200.

The previous prime is 102031021189. The next prime is 102031021207. The reversal of 102031021201 is 102120130201.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 64994403600 + 37036617601 = 254940^2 + 192449^2 .

It is an emirp because it is prime and its reverse (102120130201) is a distict prime.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-102031021201 is a prime.

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

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

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

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

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

Almost surely, 2102031021201 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 24, while the sum is 13.

Adding to 102031021201 its reverse (102120130201), we get a palindrome (204151151402).

The spelling of 102031021201 in words is "one hundred two billion, thirty-one million, twenty-one thousand, two hundred one".