Search a number
-
+
145032303112511 is a prime number
BaseRepresentation
bin100000111110011111110110…
…111010000111000100111111
3201000111221201120100210210212
4200332133312322013010333
5123002202124044100021
61232242530435223035
742356144450003633
oct4076376672070477
9630457646323725
10145032303112511
1142236944139301
1214324294a47a7b
1362c0645061809
1427b585ad1adc3
1511b7952b2085b
hex83e7f6e8713f

145032303112511 has 2 divisors, whose sum is σ = 145032303112512. Its totient is φ = 145032303112510.

The previous prime is 145032303112483. The next prime is 145032303112531. The reversal of 145032303112511 is 115211303230541.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 145032303112511 - 242 = 140634256601407 is a prime.

It is a super-2 number, since 2×1450323031125112 (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 (145032303112531) 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, 72516151556255 + 72516151556256.

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

Almost surely, 2145032303112511 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 10800, while the sum is 32.

The spelling of 145032303112511 in words is "one hundred forty-five trillion, thirty-two billion, three hundred three million, one hundred twelve thousand, five hundred eleven".