Search a number
-
+
145130451553 is a prime number
BaseRepresentation
bin1000011100101001110…
…0101111001001100001
3111212121101112211012101
42013022130233021201
54334211343422203
6150401053130401
713325316325003
oct2071234571141
9455541484171
10145130451553
11566053a134a
1224163a89a01
13108bb766a49
14704ab6a373
153b9634541d
hex21ca72f261

145130451553 has 2 divisors, whose sum is σ = 145130451554. Its totient is φ = 145130451552.

The previous prime is 145130451451. The next prime is 145130451577. The reversal of 145130451553 is 355154031541.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 130626584929 + 14503866624 = 361423^2 + 120432^2 .

It is a cyclic number.

It is not a de Polignac number, because 145130451553 - 213 = 145130443361 is a prime.

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

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

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

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

Almost surely, 2145130451553 is an apocalyptic number.

It is an amenable number.

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

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

145130451553 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 90000, while the sum is 37.

The spelling of 145130451553 in words is "one hundred forty-five billion, one hundred thirty million, four hundred fifty-one thousand, five hundred fifty-three".