Search a number
-
+
115302303350431 is a prime number
BaseRepresentation
bin11010001101110111101000…
…110101010011111010011111
3120010020210101202202021001121
4122031313220311103322133
5110103103104124203211
61045121051422151411
733200213364411631
oct3215675065237237
9503223352667047
10115302303350431
113381448335324a
1210b22438122567
134c44c64440472
1420689386caa51
15d4e426927271
hex68dde8d53e9f

115302303350431 has 2 divisors, whose sum is σ = 115302303350432. Its totient is φ = 115302303350430.

The previous prime is 115302303350363. The next prime is 115302303350453. The reversal of 115302303350431 is 134053303203511.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 115302303350431 - 27 = 115302303350303 is a prime.

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

It is a congruent number.

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

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

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

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

Almost surely, 2115302303350431 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 48600, while the sum is 34.

Adding to 115302303350431 its reverse (134053303203511), we get a palindrome (249355606553942).

The spelling of 115302303350431 in words is "one hundred fifteen trillion, three hundred two billion, three hundred three million, three hundred fifty thousand, four hundred thirty-one".