Search a number
-
+
145036930531 is a prime number
BaseRepresentation
bin1000011100010011011…
…1111110110111100011
3111212100212120110110211
42013010313332313203
54334013423234111
6150343512434551
713323102365653
oct2070467766743
9455325513424
10145036930531
1156567625649
12241386a8a57
13108a528126c
14703c584363
153b8d020521
hex21c4dfede3

145036930531 has 2 divisors, whose sum is σ = 145036930532. Its totient is φ = 145036930530.

The previous prime is 145036930459. The next prime is 145036930541. The reversal of 145036930531 is 135039630541.

It is a strong prime.

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

It is a cyclic number.

It is not a de Polignac number, because 145036930531 - 27 = 145036930403 is a prime.

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

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

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

Almost surely, 2145036930531 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 145800, while the sum is 40.

The spelling of 145036930531 in words is "one hundred forty-five billion, thirty-six million, nine hundred thirty thousand, five hundred thirty-one".