Search a number
-
+
102011311393 is a prime number
BaseRepresentation
bin101111100000001011…
…0010001010100100001
3100202022100021112210021
41133000112101110201
53132404343431033
6114510252233441
710240635561055
oct1370026212441
9322270245707
10102011311393
113a2987a9122
121792b46b881
139809417524
144d1a221c65
1529c0ad3b2d
hex17c0591521

102011311393 has 2 divisors, whose sum is σ = 102011311394. Its totient is φ = 102011311392.

The previous prime is 102011311387. The next prime is 102011311433. The reversal of 102011311393 is 393113110201.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 73347805584 + 28663505809 = 270828^2 + 169303^2 .

It is a cyclic number.

It is not a de Polignac number, because 102011311393 - 225 = 101977756961 is a prime.

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

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

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

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

Almost surely, 2102011311393 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 486, while the sum is 25.

Adding to 102011311393 its reverse (393113110201), we get a palindrome (495124421594).

The spelling of 102011311393 in words is "one hundred two billion, eleven million, three hundred eleven thousand, three hundred ninety-three".